Open AccessProceedings Article
SimICS/sun4m: a virtual workstation
Peter S. Magnusson,Fredrik Dahlgren,Håkan Grahn,Magnus Karlsson,Fredrik Larsson,Fredrik Lundholm,Andreas Moestedt,Jim Nilsson,Per Stenström,Bengt Werner +9 more
- 15 Jun 1998
- pp 10-10
TL;DR: The performance of SimICS/sun4m is sufficient to run realistic workloads, such as the database benchmark TPC-D, scaling factor 1/100, or an interactive network application such as Mozilla, and the slowdown in relation to native hardware is in the range of 25 to 75 (measured using SPECint95).
read more
Abstract: System level simulators allow computer architects and system software designers to recreate an accurate and complete replica of the program behavior of a target system, regardless of the availability, existence, or instrumentation support of such a system. Applications include evaluation of architectural design alternatives as well as software engineering tasks such as traditional debugging and performance tuning.
We present an implementation of a simulator acting as a virtual workstation fully compatible with the sun4m architecture from Sun Microsystems. Built using the system-level SPARC V8 simulator SimICS, SimICS/sun4m models one or more SPARC V8 processors, supports user-developed modules for data cache and instruction cache simulation and execution profiling of all code, and provides a symbolic and performance debugging environment for operating systems.
SimICS/sun4m can boot unmodified operating systems, including Linux 2.0.30 and Solaris 2.6, directly from snapshots of disk partitions. To support essentially arbitrary code, we implemented binary-compatible simulators for several devices, including SCSI, console, interrupt, timers, EEPROM, and Ethernet. The Ethernet simulation hooks into the host and allows the virtual workstation to appear on the local network with full services available (NFS, NIS, rsh, etc). Ethernet and console traffic can be recorded for future playback.
The performance of SimICS/sun4m is sufficient to run realistic workloads, such as the database benchmark TPC-D, scaling factor 1/100, or an interactive network application such as Mozilla. The slowdown in relation to native hardware is in the range of 25 to 75 (measured using SPECint95). We also demonstrate some applications, including modeling an 8-processor sun4m version (which does not exist), modeling future memory hierarchies, and debugging an operating system.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Proceedings Article
QEMU, a fast and portable dynamic translator
Fabrice Bellard
- 10 Apr 2005
TL;DR: QEMU supports full system emulation in which a complete and unmodified operating system is run in a virtual machine and Linux user mode emulation where a Linux process compiled for one target CPU can be run on another CPU.
•Dissertation
Efficient, transparent, and comprehensive runtime code manipulation
Derek L. Bruening,Saman Amarasinghe +1 more
- 01 Jan 2004
TL;DR: D DynamoRIO is presented, a fully-implemented runtime code manipulation system that supports code transformations on any part of a program, while it executes, with zero to thirty percent time and memory overhead on both Windows and Linux.
An Integrated Path and Timing Analysis Method based on Cycle-Level Symbolic Execution
Thomas Lundqvist,Per Stenström +1 more
TL;DR: A method that integrates path and timing analysis to accurately predict the worst-case execution time for real-time programs on high-performance processors and can exclude many infeasible program paths and calculate path information, such as bounds on number of loop iterations, without the need for manual annotations of programs.
154
•Proceedings Article
Performance of multithreaded chip multiprocessors and implications for operating system design
Alexandra Fedorova,Margo Seltzer,Christoper Small,Daniel S. Nussbaum +3 more
- 10 Apr 2005
TL;DR: To use the L2 cache as efficiently as possible, an L2-conscious scheduling algorithm is proposed and it is possible to reduce miss ratios in the L1 cache and improve processor throughput by 27-45%.
136
PhTM: Phased Transactional Memory
Dan Nussbaum,Yosef Lev,Mark Moir +2 more
- 01 Jan 2007
TL;DR: Phased Transactional Memory (PhTM) is introduced, which supports switching between different “phases”, each implemented by a different form of transactional memory support, and can match the performance and scalability of unbounded HTM implementations better than the previous HyTM prototype.
126
References
Shade: a fast instruction-set simulator for execution profiling
Bob Cmelik,David Keppel +1 more
- 01 May 1994
TL;DR: A tool called Shade is described which combines efficient instruction-set simulation with a flexible, extensible trace generation capability and discusses instruction set emulation in general.
Continuous profiling: where have all the cycles gone?
Jennifer M. Anderson,Lance M. Berc,Jeffrey Dean,Sanjay Ghemawat,Monika Henzinger,Shun-Tak Albert Leung,Richard L. Sites,Mark T. Vandevoorde,Carl A. Waldspurger,William E. Weihl +9 more
- 01 Oct 1997
TL;DR: The Digital Continuous Profiling Infrastructure is a sampling-based profiling system designed to run continuously on production systems, supporting multiprocessors, works on unmodified executables, and collects profiles for entire systems, including user programs, shared libraries, and the operating system kernel.
Embra: fast and flexible machine simulation
Emmett Witchel,Mendel Rosenblum +1 more
- 15 May 1996
TL;DR: The techniques used by Embra to achieve high performance are described, focusing on the requirements unique to machine simulation, including modeling the processor, memory management unit, and caches.
Threaded code
TL;DR: The concept of “threaded code” is presented as an alternative to machine language code and hardware and software realizations of it are given.
325
•Book
Using complete machine simulation to understand computer system behavior
Mendel Rosenblum,S. A. Herrod +1 more
- 01 Jan 1998
TL;DR: This dissertation describes complete machine simulation, a novel approach to understanding the behavior of modern computer systems that differs from existing simulation tools by modeling all of the hardware found in a typical computer system.
113
Related Papers (5)
Bob Cmelik,David Keppel +1 more
- 01 May 1994
John L. Hennessy,David A. Patterson +1 more
- 01 Dec 1989
Emmett Witchel,Mendel Rosenblum +1 more
- 15 May 1996