Show simple item record

dc.contributor.authorLis, Mieszko
dc.contributor.authorShim, Keun Sup
dc.contributor.authorCho, Myong Hyon
dc.contributor.authorFletcher, Christopher Wardlaw
dc.contributor.authorKinsy, Michel A.
dc.contributor.authorLebedev, Ilia A.
dc.contributor.authorKhan, Omer
dc.contributor.authorDevadas, Srinivas
dc.date.accessioned2012-08-27T20:39:51Z
dc.date.available2012-08-27T20:39:51Z
dc.date.issued2011-06
dc.identifier.isbn978-1-4503-0743-7
dc.identifier.urihttp://hdl.handle.net/1721.1/72358
dc.description.abstractDriven by increasingly unbalanced technology scaling and power dissipation limits, microprocessor designers have resorted to increasing the number of cores on a single chip, and pundits expect 1000-core designs to materialize in the next few years [1]. But how will memory architectures scale and how will these next-generation multicores be programmed? One barrier to scaling current memory architectures is the offchip memory bandwidth wall [1,2]: off-chip bandwidth grows with package pin density, which scales much more slowly than on-die transistor density [3]. To reduce reliance on external memories and keep data on-chip, today’s multicores integrate very large shared last-level caches on chip [4]; interconnects used with such shared caches, however, do not scale beyond relatively few cores, and the power requirements and access latencies of large caches exclude their use in chips on a 1000-core scale. For massive-scale multicores, then, we are left with relatively small per-core caches. Per-core caches on a 1000-core scale, in turn, raise the question of memory coherence. On the one hand, a shared memory abstraction is a practical necessity for general-purpose programming, and most programmers prefer a shared memory model [5]. On the other hand, ensuring coherence among private caches is an expensive proposition: bus-based and snoopy protocols don’t scale beyond relatively few cores, and directory sizes needed in cache-coherence protocols must equal a significant portion of the combined size of the per-core caches as otherwise directory evictions will limit performance [6]. Moreover, directory-based coherence protocols are notoriously difficult to implement and verify [7].en_US
dc.language.isoen_US
dc.publisherAssociation for Computing Machinery (ACM)en_US
dc.relation.isversionofhttp://dx.doi.org/10.1145/1989493.1989530en_US
dc.rightsCreative Commons Attribution-Noncommercial-Share Alike 3.0en_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/3.0/en_US
dc.sourceMIT web domainen_US
dc.titleBrief announcement: Distributed shared memory based on computation migrationen_US
dc.typeArticleen_US
dc.identifier.citationMieszko Lis, Keun Sup Shim, Myong Hyon Cho, Christopher W. Fletcher, Michel Kinsy, Ilia Lebedev, Omer Khan, and Srinivas Devadas. 2011. Brief announcement: distributed shared memory based on computation migration. In Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures (SPAA '11). ACM, New York, NY, USA, 253-256.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratoryen_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Scienceen_US
dc.contributor.approverDevadas, Srinivas
dc.contributor.mitauthorLis, Mieszko
dc.contributor.mitauthorShim, Keun Sup
dc.contributor.mitauthorCho, Myong Hyon
dc.contributor.mitauthorFletcher, Christopher Wardlaw
dc.contributor.mitauthorKinsy, Michel A.
dc.contributor.mitauthorLebedev, Ilia A.
dc.contributor.mitauthorKhan, Omer
dc.contributor.mitauthorDevadas, Srinivas
dc.relation.journalProceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA '11)en_US
dc.eprint.versionAuthor's final manuscripten_US
dc.type.urihttp://purl.org/eprint/type/ConferencePaperen_US
dspace.orderedauthorsLis, Mieszko; Shim, Keun Sup; Cho, Myong Hyon; Fletcher, Christopher W.; Kinsy, Michel; Lebedev, Ilia; Khan, Omer; Devadas, Srinivasen
dc.identifier.orcidhttps://orcid.org/0000-0001-8253-7714
dc.identifier.orcidhttps://orcid.org/0000-0003-4301-1159
dc.identifier.orcidhttps://orcid.org/0000-0001-5490-2323
dc.identifier.orcidhttps://orcid.org/0000-0003-1467-2150
dspace.mitauthor.errortrue
mit.licenseOPEN_ACCESS_POLICYen_US
mit.metadata.statusComplete


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record