Managing contention for Shared Resources on Multicore Processors
Running Head: MULTICORE PROCESSORS
Case Study 3: Managing Contention for Shared Resources on Multicore Processors
Strayer University
Instructor: Dr. Kegan Samuel
CIS 512 Advanced Computer Architecture
November 30, 2013
Abstract
This “Case Study” cover information on computer systems with multicore processors which can increase performance by running applications of various types (models) and methods. This paper focuses on applications using distributed architecture, cache contention, prefetching hardware and more. Current and future contentions are discussed. Managing contention for shared resources on multicore processors are discussed in this assignment. Explanations given for causes of contention. Discussion of the author’s testing of applications, building of prototypes and more. The discussion of architecture software and hardware as well as methods to avoid and other alternatives and solutions (Fedorova, Blagodurov & Zhuravlev, 2006; 2009).
Estimate the authors’ findings. The findings of the author’s will be listed below and they are based on the groups from the three test that the authors performed, in which they ran group applications several times on three different schedules and every time with two pairings that shared a memory domain. The pairs consisted of the following Soplex and Sphinx was ran in a memory domain, while Gamess and Namd shared another memory domain and then Sphinx was paired with Namd, and Soplex was paired and ran with Gamess together. Then a contrast was done on each application with its worst performance, in which the performance levels indicated in the terms of percentage and degradation from solo execution times and the bottom line or the test of the applications is that the lower the numbers, the better the performance (Fedorova, Blagodurov & Zhuravlev, 2006; 2009).
Analyze the schedule that the authors used to test the applications using a distributed architecture.
Case Study 3: Managing Contention for Shared Resources on Multicore Processors
Strayer University
Instructor: Dr. Kegan Samuel
CIS 512 Advanced Computer Architecture
November 30, 2013
Abstract
This “Case Study” cover information on computer systems with multicore processors which can increase performance by running applications of various types (models) and methods. This paper focuses on applications using distributed architecture, cache contention, prefetching hardware and more. Current and future contentions are discussed. Managing contention for shared resources on multicore processors are discussed in this assignment. Explanations given for causes of contention. Discussion of the author’s testing of applications, building of prototypes and more. The discussion of architecture software and hardware as well as methods to avoid and other alternatives and solutions (Fedorova, Blagodurov & Zhuravlev, 2006; 2009).
Estimate the authors’ findings. The findings of the author’s will be listed below and they are based on the groups from the three test that the authors performed, in which they ran group applications several times on three different schedules and every time with two pairings that shared a memory domain. The pairs consisted of the following Soplex and Sphinx was ran in a memory domain, while Gamess and Namd shared another memory domain and then Sphinx was paired with Namd, and Soplex was paired and ran with Gamess together. Then a contrast was done on each application with its worst performance, in which the performance levels indicated in the terms of percentage and degradation from solo execution times and the bottom line or the test of the applications is that the lower the numbers, the better the performance (Fedorova, Blagodurov & Zhuravlev, 2006; 2009).
Analyze the schedule that the authors used to test the applications using a distributed architecture.
References: Fedora, A., Blagodurov, S., and Zhuravlev, S., (2006; 2009). Acmqueue: Managing Contention for Shared Resources on Multicore Processor. Retrieved from: Suh, G., Devdas, S., Rudolph, L. (2002). A new memory monitoring scheme for memory-aware scheduling and partitioning. In Proceedings of the Eighth International Symposium on High-performance Computer Architecture, p.117. Tam, D., Azimi, R. and Stumm, M. (2007). Thread clustering sharing-aware scheduling on SMP-CMP-SMY multiprocessors. On Proceeding of the 2nd ACM SICOPS/EuroSys European Conference on Computer Systems, pp. 47-58. Retrieved from: