Richard L. Halpert, Christopher J. F. Pickett, Clark Verbrugge
{"title":"Component-Based Lock Allocation","authors":"Richard L. Halpert, Christopher J. F. Pickett, Clark Verbrugge","doi":"10.1109/PACT.2007.23","DOIUrl":"https://doi.org/10.1109/PACT.2007.23","url":null,"abstract":"The allocation of lock objects to critical sections in concurrent programs affects both performance and correctness. Recent work explores automatic lock allocation, aiming primarily to minimize conflicts and maximize parallelism by allocating locks to individual critical section interferences. We investigate component-based lock allocation, which allocates locks to entire groups of interfering critical sections. Our allocator depends on a thread-based side effect analysis, and benefits from precise points-to and may happen in parallel information. Thread-local object information has a small impact, and dynamic locks do not improve significantly on static locks. We experiment with a range of small and large Java benchmarks on 2-way, 4-way, and 8-way machines, and find that a single static lock is sufficient for mtrt, that performance degrades by 10% for hsqldb, that jbb2000 becomes mostly serialized, and that for lusearch, xalan, and jbb2005, component-based lock allocation recovers the performance of the original program.","PeriodicalId":401396,"journal":{"name":"16th International Conference on Parallel Architecture and Compilation Techniques (PACT 2007)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114105693","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}
{"title":"A Loop Correlation Technique to Improve Performance Auditing","authors":"Jeremy Lau, Matthew Arnold, M. Hind, B. Calder","doi":"10.1109/PACT.2007.7","DOIUrl":"https://doi.org/10.1109/PACT.2007.7","url":null,"abstract":"Performance auditing is an online optimization strategy that empirically measures the effectiveness of an optimization on a particular code region. It has the potential to greatly improve performance and prevent degradations due to compiler optimizations. Performance auditing relies on the ability to obtain sufficiently many timings of the region of code to make statistically valid conclusions. This work extends the state-of-the-art of performance auditing systems by allowing a finer level of granularity for obtaining timings and thus, increases the overall effectiveness of a performance auditing system. The problem solved by our technique is an instance of the general problem of correlating a program's high-level behavior with its binary instructions, and thus, can have uses beyond a performance auditing system. We present our implementation and evaluation of our technique in a production Java VM.","PeriodicalId":401396,"journal":{"name":"16th International Conference on Parallel Architecture and Compilation Techniques (PACT 2007)","volume":"21 9","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120853768","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}
Xiaofeng Guo, J. Dai, Long Li, Zhiyuan Lv, P. Chandra
{"title":"Latency Hiding in Multi-Threading and Multi-Processing of Network Applications","authors":"Xiaofeng Guo, J. Dai, Long Li, Zhiyuan Lv, P. Chandra","doi":"10.1109/PACT.2007.46","DOIUrl":"https://doi.org/10.1109/PACT.2007.46","url":null,"abstract":"Network processors employ a multithreaded, chip-multiprocessing architecture to effectively hide memory latency and deliver high performance for packet processing applications. In such a parallel paradigm, when multiple threads modify a shared variable in the external memory, the threads should be properly synchronized such that the accesses to the shared variable are protected by critical sections. Therefore, in order to efficiently harness the performance potential of network processors, it is critical to hide the memory latency and synchronization latency in multi-threading and multiprocessing. In this paper, we present a novel program transformation used in the Intelreg Auto-partitioning C Compiler for IXP, which perform optimal placement of memory access instructions and synchronization instructions for effective latency hiding. Experimental results show that the transformation provides impressive speedup (up-to to 8.5x) and scalability (up- to 72 threads) of the performance for the real-world network application (a 10Gbps Ethernet Core/Metro Router).","PeriodicalId":401396,"journal":{"name":"16th International Conference on Parallel Architecture and Compilation Techniques (PACT 2007)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131927031","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}
{"title":"Performance Portable Optimizations for Loops Containing Communication Operations","authors":"Costin Iancu, Wei Chen, K. Yelick","doi":"10.1145/1375527.1375567","DOIUrl":"https://doi.org/10.1145/1375527.1375567","url":null,"abstract":"As high end computing systems continue to scale in CPU computational power and overall node count, optimization techniques that can reduce communication overhead have proven important. We present a loop optimization framework designed to achieve both efficient communication/computation overlap and performance portability. The framework has been implemented in the Berkeley UPC compiler and uses a combination of compile time analysis and runtime mechanisms. We extend the compiler to perform message vectorization and message strip mining optimizations. At compile time loop nests are analyzed, their communication requirements are determined, and the computation overhead is estimated. The compiler passes analysis information to the runtime and performance portability is achieved by decoupling data movement from local computation. We generate template code that uses the transferred data without making any assumptions about the communication mechanism.","PeriodicalId":401396,"journal":{"name":"16th International Conference on Parallel Architecture and Compilation Techniques (PACT 2007)","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132536343","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}
Sayaka Akioka, Feihui Li, M. Kandemir, P. Raghavan, M. J. Irwin
{"title":"Ring Prediction for Non-Uniform Cache Architectures","authors":"Sayaka Akioka, Feihui Li, M. Kandemir, P. Raghavan, M. J. Irwin","doi":"10.1109/PACT.2007.60","DOIUrl":"https://doi.org/10.1109/PACT.2007.60","url":null,"abstract":"Increasing wire delays and memory capacities motivate new ways of designing 12 and 13 caches. NUCA (non-uniform cache architecture) has received considerable attention in the last few years. While most of the prior NUCA-based efforts have focused on data placement, data replacement, and migration related issues, this paper studies the problem of data search. Specifically, it proposes and experimentally evaluates several data search schemes for NUCA L2 caches that exhibit different performance-power trade-offs. These schemes are based on predicting the next ring (set of banks) to be accessed in a NUCA L2, and checking the banks in that ring first. In this work, we present the details of these prediction schemes, and compare them to two alternate approaches: searching all rings in parallel, and searching rings sequentially, starting with the one that is closest to the CPU.","PeriodicalId":401396,"journal":{"name":"16th International Conference on Parallel Architecture and Compilation Techniques (PACT 2007)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126587050","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}