James Patrick Robertson

TL;DR: It is shown that for the cases studied here, the relatively simple Min?min heuristic performs well in comparison to the other techniques, and one even basis for comparison and insights into circumstances where one technique will out-perform another.

TL;DR: A new taxonomy for classifying mapping heuristics for HC environments is proposed (Purdue HC Taxonomy), defined in three major parts: the models used for applications and communication requests; the models use for target hardware platforms; and the characteristics of mappingHeuristics.

TL;DR: This chapter presents a three-part classification scheme ( 3PCS ) for HC systems that is useful for researchers who want to understand a mapper given in the literature, describe their design of a mappers more thoroughly by using a common standard, and select a mapping to match a given real-world environment.

TL;DR: Performance analysis shows that the proposed generalized Cannon’s algorithm (GCA) requires fewer page faults than a previously proposed algorithm (SUMMA), and it is shown that GCA maintains higher performance for large matrices than SUMMA.

TL;DR: In this paper, the authors present a technique for processing commands received by an intermediary cache from one or more clients, where the first write command specifies a first memory address, determining that a first cache line related to a set of cache lines included in the intermediary cache is associated with the first memory addresses, causing data associated with first write commands to be written into the first cache lines, and marking the cache line as dirty.