File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Making parallel programs reliable with stable multithreading

TitleMaking parallel programs reliable with stable multithreading
Authors
Issue Date2014
Citation
Communications of the ACM, 2014, v. 57, n. 3, p. 58-69 How to Cite?
AbstractStable multithreading simplifies the interleaving behaviors of parallel programs, offering new hope for making parallel programming easier. To eliminate non-determinism, several groups of researchers, have dedicated themselves to building deterministic multithreading (DMT) systems that force multithreaded programs to always execute the same thread interleaving. By mapping each input to only one schedule, DMT brings determinism, a key property of sequential computing, into multithreading. Stable multithreading, or StableMT, reuses each schedule on a range of inputs, mapping all inputs to a dramatically reduced set of schedules. StableMT can stabilize program behaviors for better reliability, so it works efficiently and deterministically while greatly improving precision of static analysis. Moreover, it promises to help solve the grand challenge of making parallel programming easy.
Persistent Identifierhttp://hdl.handle.net/10722/207906
ISSN
2015 Impact Factor: 3.301
2015 SCImago Journal Rankings: 1.910

 

DC FieldValueLanguage
dc.contributor.authorYang, J-
dc.contributor.authorCui, H-
dc.contributor.authorWu, J-
dc.contributor.authorTang, Y-
dc.contributor.authorHu, G-
dc.date.accessioned2015-01-26T11:46:42Z-
dc.date.available2015-01-26T11:46:42Z-
dc.date.issued2014-
dc.identifier.citationCommunications of the ACM, 2014, v. 57, n. 3, p. 58-69-
dc.identifier.issn0001-0782-
dc.identifier.urihttp://hdl.handle.net/10722/207906-
dc.description.abstractStable multithreading simplifies the interleaving behaviors of parallel programs, offering new hope for making parallel programming easier. To eliminate non-determinism, several groups of researchers, have dedicated themselves to building deterministic multithreading (DMT) systems that force multithreaded programs to always execute the same thread interleaving. By mapping each input to only one schedule, DMT brings determinism, a key property of sequential computing, into multithreading. Stable multithreading, or StableMT, reuses each schedule on a range of inputs, mapping all inputs to a dramatically reduced set of schedules. StableMT can stabilize program behaviors for better reliability, so it works efficiently and deterministically while greatly improving precision of static analysis. Moreover, it promises to help solve the grand challenge of making parallel programming easy.-
dc.languageeng-
dc.relation.ispartofCommunications of the ACM-
dc.titleMaking parallel programs reliable with stable multithreading-
dc.typeArticle-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1145/2500875-
dc.identifier.scopuseid_2-s2.0-84897555318-
dc.identifier.volume57-
dc.identifier.issue3-
dc.identifier.spage58-
dc.identifier.epage69-
dc.identifier.eissn1557-7317-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats