University of Patras
Διαχείριση κοινόχρηστων πόρων σε πολυεπεξεργαστικά συστήματα ενός ολοκληρωμένου
Abstract
dc:descriptionThis dissertation proposes methodologies for the management of shared resources in chip multi-processors {CMP). Until recently the design of a computing system had to satisfy the computational and storage needs of a single program during each time period. Now instead the designer has to balance the perhaps conflicting needs of multiple programs competing for the same resources. But in many cases even this is not enough. Even if we could invent a perfect way to manage sharing, without optimizing the way that each processor uses the shared resource, the resource could not deal efficiently with the increased load. In order to handle the negative effects of resource sharing this dissertation proposes three management mechanisms. The first one introduces a novel theoretical model of the sharing of the shared cache which can be used at run-time. Furthermore, out methodology uses the model to control sharing and to achieve a sense of justice in the way the cache is shared among the processors. Our second methodology presents a new technique for predicting the locality of cache accesses. Since locality determines almost entirely the usefulness of cache data, our technique can be used to drive any management mechanism which strives to improve the efficiency of the cache. As part of our methodology, we present such a mechanism, a new cache replacement policy which tries to minimize cache misses by near-optimal replacement decisions. The last methodology presented in this dissertation, targets the energy consumption of the processor. To that end, our methodology shows that the key to reducing the power consumption of the Issue Queue, without disproportional performance degradation, lies at the interaction of the Issue Queue with the memory subsystem: as long as the management of the Issue Queue doesn’t reduce the utilization of the memory subsystem, the effects of the management on the processors performance will be minimal. Based on this conclusion, we introduce a new mechanism for dynamically resizing the Issue Queue, which achieves aggressive downsizing and energy savings with almost no performance degradation.
Degree
thesis:*- Grantor dc:publisher
- University of Patras
- Year dc:date
- 2011
Author and committee
dc:creator, dc:contributor.*- Authors dc:creator
-
- Petoumenos, Pavlos
- Πετούμενος, Παύλος
Subjects
dc:subject × 16- Αρχιτεκτονική υπολογιστών
- Πολυεπεξεργαστικά συστήματα
- Κρυφές μνήμες
- Ουρά εντολών
- Μηχανισμοί πρόβλεψης
- Κατανάλωση ισχύος
- Computer architecture
- Chip multiprocessors
- CPU caches
- Instruction queue
- Prediction mechanisms
- Power-aware management techniques
- Επιστήμες Μηχανικού και Τεχνολογία
- Επιστήμη Ηλεκτρολόγου Μηχανικού, Ηλεκτρονικού Μηχανικού, Μηχανικού Η/Υ
- Engineering and Technology
- Electrical Engineering, Electronic Engineering, Information Engineering
Rights
- Language dc:language
- gre
Identifiers
dc:identifier.*- Identifier
- 10.12681/eadd/25679