M
Mark D. Hill
Researcher at University of Wisconsin-Madison
Publications - 272
Citations - 26551
Mark D. Hill is an academic researcher from University of Wisconsin-Madison. The author has contributed to research in topics: Cache & Shared memory. The author has an hindex of 81, co-authored 269 publications receiving 25078 citations. Previous affiliations of Mark D. Hill include Advanced Micro Devices & University of California, Berkeley.
Papers
More filters
Journal ArticleDOI
The gem5 simulator
Nathan Binkert,Bradford M. Beckmann,Gabriel Black,Steven K. Reinhardt,Ali G. Saidi,Arkaprava Basu,Joel Hestness,Derek R. Hower,Tushar Krishna,Somayeh Sardashti,Rathijit Sen,Korey Sewell,Muhammad Shoaib,Nilay Vaish,Mark D. Hill,Darien Wood +15 more
TL;DR: The high level of collaboration on the gem5 project, combined with the previous success of the component parts and a liberal BSD-like license, make gem5 a valuable full-system simulation tool.
Journal ArticleDOI
Multifacet's general execution-driven multiprocessor simulator (GEMS) toolset
Milo M. K. Martin,Daniel J. Sorin,Bradford M. Beckmann,Michael R. Marty,Min Xu,Alaa R. Alameldeen,Kevin E. Moore,Mark D. Hill,Darien Wood +8 more
TL;DR: The Wisconsin Multifacet Project has created a simulation toolset to characterize and evaluate the performance of multiprocessor hardware systems commonly used as database and web servers as mentioned in this paper, which includes a set of timing simulator modules for modeling the timing of the memory system and microprocessors.
Journal ArticleDOI
Amdahl's Law in the Multicore Era
Mark D. Hill,Michael R. Marty +1 more
TL;DR: Augmenting Amdahl's law with a corollary for multicore hardware makes it relevant to future generations of chips with multiple processor cores.
Proceedings ArticleDOI
LogTM: log-based transactional memory
TL;DR: This paper presents a new implementation of transactional memory, log-based transactionalMemory (LogTM), that makes commits fast by storing old values to a per-thread log in cacheable virtual memory and storing new values in place.
Journal ArticleDOI
Evaluating associativity in CPU caches
Mark D. Hill,Alan Jay Smith +1 more
TL;DR: All-associativity simulation is theoretically less efficient than forest simulation or stack simulation (a commonly used simulation algorithm), in practice it is not much slower and allows the simulation of many more caches with a single pass through an address trace.