Massively parallel algorithms for trace-driven cache simulations
نویسندگان
چکیده
منابع مشابه
Massively Parallel Algorithms for Trace-Driven Cache Simulations
Trace-driven cache simulation is central to computer design. A trace is a very long sequence, zl, ..., iN, of references to lines (contiguous locations) from main memory. At the t th instant, reference z, is hashed into a set of cache locations, the contents of which are then compared with _t. If at the t th instant zt is not present in the cache, then it is said to be a miss, and is loaded int...
متن کاملMassively Parallel Genetic Algorithms
Heuristic algorithms are usually employed to find an optimal solution to NP-Complete problems. Genetic algorithms are among such algorithms and they are search algorithms based on the mechanics of natural selection and genetics. Since genetic algorithms work with a set of candidate solutions, parallelisation based on the SIMD paradigm seems to be the natural way to obtain a speed up. In this ap...
متن کاملMassively Parallel Genetic Algorithms
The genetic algorithm is an iterative random search technique for nonlinear or combi-natorial problems. In this contribution, rst the development from the classical genetic algorithm (GA) via the parallel genetic algorithm (PGA) to the massively parallel genetic algorithm (MPGA) is described. Then experimental results with an implementation of the MPGA on the array processor MasPar MP-1 are dis...
متن کاملExpressing Massively Parallel Algorithms for Irregular Data Expressing Massively Parallel Algorithms for Irregular Data
In this paper we present a data-parallel language called MPL, for which the basic data structure is the graph. The purpose of this language is to program numerical algorithms that use irregular data, and to allow them to execute on distributed memory MIMD machines. We deene the graph data structure and give some examples of how irregular data structures can be described from graphs with our app...
متن کاملMassively-Parallel Dislocation Dynamics Simulations
Prediction of the plastic strength of single crystals based on the collective dynamics of dislocations has been a challenge for computational materials science for a number of years. The difficulty lies in the inability of the existing dislocation dynamics (DD) codes to handle a sufficiently large number of dislocation lines, in order to be statistically representative and to reproduce experime...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Parallel and Distributed Systems
سال: 1994
ISSN: 1045-9219
DOI: 10.1109/71.298211