Abstract
Trace-driven simulation is the most widely used method to evaluate caches. This demands large amounts of storage and computer time. Several techniques have been proposed to reduce the simulation time of sequential trace-driven simulation. However, little has been done to exploit parallelism. In this paper, we present some efficient parallel simulation techniques that exploit set-partitioning as the main source of parallelism. We show that a straightforward implementation does not give much speedup as one might expect. We develop more efficient parallel simulation techniques by introducing more knowl edge into the cache simulator. The techniques presented here can be efficiently used on multiprocessor worksta tions.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.