Abstract | ||
---|---|---|
With the evolution toward fast networks of many-core processors, the design assumptions at the basis of software-level distributed shared memory (DSM) systems change considerably. But efficient DSMs are needed because they can significantly simplify the implementation of complex distributed algorithms. This paper discusses implications of the many-core evolution and derives a set of reusable elementary operations for future software DSMs. These elementary operations will help in exploring and evaluating new memory models and consistency protocols. |
Year | DOI | Venue |
---|---|---|
2014 | 10.1007/978-3-319-14313-2_30 | Lecture Notes in Computer Science |
Field | DocType | Volume |
Shared memory,Computer science,Transactional memory,Memory model,Software,Distributed algorithm,Remote memory,Distributed shared memory,Distributed computing | Conference | 8806 |
ISSN | Citations | PageRank |
0302-9743 | 0 | 0.34 |
References | Authors | |
22 | 5 |
Name | Order | Citations | PageRank |
---|---|---|---|
Stefan Nürnberger | 1 | 249 | 12.79 |
Gabor Drescher | 2 | 8 | 2.67 |
Randolf Rotta | 3 | 114 | 8.98 |
Jörg Nolte | 4 | 29 | 10.00 |
Wolfgang Schröder-Preikschat | 5 | 0 | 1.35 |