File Download

There are no files associated with this item.

  • Find it @ UNIST can give you direct access to the published full text of this article. (UNISTARs only)
Related Researcher

백웅기

Baek, Woongki
Intelligent System Software Lab.
Read More

Views & Downloads

Detailed Information

Cited time in webofscience Cited time in scopus
Metadata Downloads

Full metadata record

DC Field Value Language
dc.citation.conferencePlace US -
dc.citation.conferencePlace Yorktown Heights, NY -
dc.citation.endPage 125 -
dc.citation.startPage 117 -
dc.citation.title 23rd International Conference on Supercomputing, ICS'09 -
dc.contributor.author Baek, Woongki -
dc.contributor.author Chung, Jaewoong -
dc.contributor.author Kozyrakis, Christos -
dc.date.accessioned 2023-12-20T04:08:10Z -
dc.date.available 2023-12-20T04:08:10Z -
dc.date.created 2015-07-09 -
dc.date.issued 2009-06-08 -
dc.description.abstract The industry-wide turn toward chip-multiprocessors (CMPs) provides an increasing amount of parallel resources for commodity systems. However, it is still difficult to harness the available parallelism in user applications and system software code. We propose MShot, a hardware-assisted memory snapshot for concurrent programming without synchronization code. It supports atomic multi-word read operations on a large dataset. Since modern processors support atomic access only to a single word, programmers should add synchronization code to process a multiword dataset concurrently in multithreading environment. With snapshot, programmers read the dataset atomically and process the snapshot image without synchronization code. We implement MShot using hardware resources for transactional memory and reduce the storage overhead from 2.98% to 0.07%. To demonstrate the usefulness of fast snapshot, we use MShot to implement concurrent versions of garbage collection and call-path profiling. Without the need for synchronization code, MShot allows such system services to run in parallel with user applications on spare cores in CMP systems. As a result, the overhead of these services is minimized, approaching that of an ideal implementation. Copyright 2009 ACM. -
dc.identifier.bibliographicCitation 23rd International Conference on Supercomputing, ICS'09, pp.117 - 125 -
dc.identifier.doi 10.1145/1542275.1542297 -
dc.identifier.scopusid 2-s2.0-70449715743 -
dc.identifier.uri https://scholarworks.unist.ac.kr/handle/201301/46840 -
dc.identifier.url http://dl.acm.org/citation.cfm?doid=1542275.1542297 -
dc.language 영어 -
dc.publisher 23rd International Conference on Supercomputing, ICS'09 -
dc.title Fast memory snapshot for concurrent programming without synchronization -
dc.type Conference Paper -
dc.date.conferenceDate 2009-06-08 -

qrcode

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.