2009 Eighth International Symposium on Parallel and Distributed Computing最新文献_第4页

Monitoring of Complex Applications Execution in Distributed Dependable Systems 分布式可靠系统中复杂应用程序执行的监控

2009 Eighth International Symposium on Parallel and Distributed Computing Pub Date : 2009-06-30 DOI: 10.1109/ISPDC.2009.38

Florin Pop, Alexandru Costan, C. Dobre, Corina Stratan, V. Cristea

引用次数: 1

A Concept for Grid Credential Lifecycle Management and Heuristic Credential Abuse Detection 网格证书生命周期管理和启发式证书滥用检测的概念

2009 Eighth International Symposium on Parallel and Distributed Computing Pub Date : 2009-06-30 DOI: 10.1109/ISPDC.2009.28

Christopher Kunz, J. Wiebelitz, S. Piger, C. Grimm

引用次数: 3

Dynamic Job Scheduling on Heterogeneous Clusters 异构集群动态任务调度

2009 Eighth International Symposium on Parallel and Distributed Computing Pub Date : 2009-06-30 DOI: 10.1109/ISPDC.2009.19

Jorge G. Barbosa, B. Moreira

引用次数: 25

On the Performance of Contention Managers for Complex Transactional Memory Benchmarks 复杂事务性内存基准的争用管理器性能研究

2009 Eighth International Symposium on Parallel and Distributed Computing Pub Date : 2009-06-30 DOI: 10.1109/ISPDC.2009.18

Mohammad Ansari, Christos Kotselidis, M. Luján, C. Kirkham, I. Watson

{"title":"On the Performance of Contention Managers for Complex Transactional Memory Benchmarks","authors":"Mohammad Ansari, Christos Kotselidis, M. Luján, C. Kirkham, I. Watson","doi":"10.1109/ISPDC.2009.18","DOIUrl":"https://doi.org/10.1109/ISPDC.2009.18","url":null,"abstract":"In Transactional Memory (TM), contention management is the process of selecting which transaction should be aborted when a data access conflict arises. In this paper, the performance of published contention managers (CMs) is re-investigated using complex benchmarks recently published in the literature. Our results redefine the CM performance hierarchy. Greedy and Priority are found to give the best performance overall. Polka is still competitive, but by no means best performing as previously published, and in some cases degrading performance by orders of magnitude. In the worst example, execution of a benchmark completes in 6.5 seconds with Priority, yet fails to complete even after 20 minutes with Polka. Analysis of the benchmark found it aborted only 22% of all transactions, spread consistently over the duration of its execution. More generally, all delay-based CMs, which pause a transaction for some finite duration upon conflict, are found to be unsuitable for the evaluated benchmarks with even moderate amounts of contention. This has significant implications, given that TM is primarily aimedat easing concurrent programming for mainstream software development, where applications are unlikely to be highly optimised to reduce aborts.","PeriodicalId":226126,"journal":{"name":"2009 Eighth International Symposium on Parallel and Distributed Computing","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127373103","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}

引用次数: 17