RACES '12最新文献

How FIFO is your concurrent FIFO queue? 如何FIFO是你的并发FIFO队列?

RACES '12 Pub Date : 2012-10-21 DOI: 10.1145/2414729.2414731

Andreas Haas, C. Kirsch, Michael Lippautz, H. Payer

{"title":"How FIFO is your concurrent FIFO queue?","authors":"Andreas Haas, C. Kirsch, Michael Lippautz, H. Payer","doi":"10.1145/2414729.2414731","DOIUrl":"https://doi.org/10.1145/2414729.2414731","url":null,"abstract":"Designing and implementing high-performance concurrent data structures whose access performance scales on multicore hardware is difficult. Concurrent implementations of FIFO queues, for example, seem to require algorithms that efficiently increase the potential for parallel access by implementing semantically relaxed rather than strict FIFO queues where elements may be returned in some out-of-order fashion. However, we show experimentally that the on average shorter execution time of enqueue and dequeue operations of fast but relaxed implementations may offset the effect of semantical relaxations making them appear as behaving more FIFO than strict but slow implementations. Our key assumption is that ideal concurrent data structure operations should execute in zero time. We define two metrics, element-fairness and operation-fairness, to measure the degree of element and operation reordering, respectively, assuming operations take zero time. Element-fairness quantifies the deviation from FIFO queue semantics had all operations executed in zero time. With this metric even strict implementations of FIFO queues are not FIFO. Operation-fairness helps explaining element-fairness by quantifying operation reordering when considering the actual time operations took effect relative to their invocation time. In our experiments, the effect of poor operation-fairness of strict but slow implementations on element-fairness may outweigh the effect of semantical relaxation of fast but relaxed implementations.","PeriodicalId":137547,"journal":{"name":"RACES '12","volume":"139 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127476271","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 15

Approximate parallel sorting on a spatial computer 空间计算机上的近似并行排序

RACES '12 Pub Date : 2012-10-21 DOI: 10.1145/2414729.2414739

Max OrHai, A. Black

引用次数: 1

Does better throughput require worse latency? 更好的吞吐量是否需要更差的延迟?

RACES '12 Pub Date : 2012-10-21 DOI: 10.1145/2414729.2414736

D. Ungar, D. Kimelman, Sam S. Adams, M. Wegman

引用次数: 0

Dancing with uncertainty 与不确定性共舞

RACES '12 Pub Date : 2012-10-21 DOI: 10.1145/2414729.2414738

Sasa Misailovic, Stelios Sidiroglou, M. Rinard

引用次数: 36

Edge chasing delayed consistency: pushing the limits of weak memory models 边缘追逐延迟一致性:推动弱内存模型的极限

RACES '12 Pub Date : 2012-10-21 DOI: 10.1145/2414729.2414733

Harold W. Cain, Mikko H. Lipasti

引用次数: 1

Programming with relaxed synchronization 轻松同步编程

RACES '12 Pub Date : 2012-10-21 DOI: 10.1145/2414729.2414737

Lakshminarayanan Renganarayana, V. Srinivasan, R. Nair, D. Prener

引用次数: 84

Position paper: nondeterminism is unavoidable, but data races are pure evil 立场文件:不确定性是不可避免的，但数据竞赛是纯粹的邪恶

RACES '12 Pub Date : 2012-10-21 DOI: 10.1145/2414729.2414732

H. Boehm

{"title":"Position paper: nondeterminism is unavoidable, but data races are pure evil","authors":"H. Boehm","doi":"10.1145/2414729.2414732","DOIUrl":"https://doi.org/10.1145/2414729.2414732","url":null,"abstract":"Modern mainstream programming languages distinguish between \"atomic\" (or sometimes \"volatile\") variables, and ordinary data. Atomic accesses are treated as synchronization constructs, and support concurrent access with well-defined semantics. In contrast, concurrent accesses to ordinary data, if at least one access is an update, constitute a data race. Code with data races does not have well-defined semantics. Such code may fail completely when recompiled or run on a different operating system version. In C and C++ data races are equivalent to assignments to out-of-bounds array elements; any data race can result in arbitrary failures, including application crashes, hangs, and inexplicably and completely wrong answers.\u0000 These language specifications, combined with implementation realities, make it unsafe to exploit \"benign\" data races to obtain performance, even if we are willing to tolerate approximate answers. Furthermore, even if we happen to get lucky, and code with data races happens to execute correctly with our current compiler, data races provide at best inconsequential performance advantages over atomics. In fact, there are interesting, and probably common, cases in which data races provide only a minor performance advantage, even over pervasive locking to avoid them, it at sufficiently large core counts. We demonstrate such a case.","PeriodicalId":137547,"journal":{"name":"RACES '12","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127614677","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 48

A case for relativistic programming 相对论规划的一个例子

RACES '12 Pub Date : 2012-10-21 DOI: 10.1145/2414729.2414735

Philip W. Howard, J. Walpole

引用次数: 2

Beyond expert-only parallel programming? 超越仅限专家的并行编程?

RACES '12 Pub Date : 2012-10-21 DOI: 10.1145/2414729.2414734

P. McKenney

引用次数: 1