Filter Results:
- Full text PDF available (13)
Publication Year
1997
2018
- This year (13)
- Last 5 years (44)
- Last 10 years (100)
Publication Type
Co-author
Journals and Conferences
Learn More
- Chi Cao Minh, JaeWoong Chung, Christoforos E. Kozyrakis, Kunle Olukotun
- IEEE International Symposium on Workload…
- 2008
Transactional Memory (TM) is emerging as a promising technology to simplify parallel programming. While several TM systems have been proposed in the research literature, we are still missing the… (More)
- Lance Hammond, Vicky Wong, +7 authors Kunle Olukotun
- Proceedings. 31st Annual International Symposium…
- 2004
In this paper, we propos a new shared memory model: Transactionalmemory Coherence and Consistency (TCC).TCC providesa model in which atomic transactions are always the basicunit of parallel work,… (More)
- Colby Ranger, Ramanan Raghuraman, Arun Penmetsa, Gary R. Bradski, Christoforos E. Kozyrakis
- IEEE 13th International Symposium on High…
- 2007
This paper evaluates the suitability of the MapReduce model for multi-core and multi-processor systems. MapReduce was created by Google for application development on data-centers with thousands of… (More)
- Chi Cao Minh, Martin Trautmann, +5 authors Kunle Olukotun
- ISCA
- 2007
We propose signature-accelerated transactional memory (SigTM), ahybrid TM system that reduces the overhead of software transactions. SigTM uses hardware signatures to track the read-set and write-set… (More)
- Christina Delimitrou, Christoforos E. Kozyrakis
- ASPLOS
- 2014
Cloud computing promises flexibility and high performance for users and high cost-efficiency for operators. Nevertheless, most cloud facilities operate at very low utilization, hurting both cost… (More)
High-level semantic vulnerabilities such as SQL injection and crosssite scripting have surpassed buffer overflows as the most prevalent security exploits. The breadth and diversity of software… (More)
- Richard M. Yoo, Anthony Romano, Christoforos E. Kozyrakis
- IEEE International Symposium on Workload…
- 2009
Dynamic runtimes can simplify parallel programming by automatically managing concurrency and locality without further burdening the programmer. Nevertheless, implementing such runtime systems for… (More)
- Daniel Sánchez, Christoforos E. Kozyrakis
- ISCA
- 2013
Architectural simulation is time-consuming, and the trend towards hundreds of cores is making sequential simulation even slower. Existing parallel simulation techniques either scale poorly due to… (More)
- John K. Ousterhout, Parag Agrawal, +10 authors Ryan Stutsman
- Operating Systems Review
- 2009
Disk-oriented approaches to online storage are becoming increasingly problematic: they do not scale gracefully to meet the needs of large-scale Web applications, and improvements in disk capacity… (More)
- Hassan Chafi, Jared Casper, +5 authors Kunle Olukotun
- IEEE 13th International Symposium on High…
- 2007
Transactional memory (TM) provides mechanisms that promise to simplify parallel programming by eliminating the need for locks and their associated problems (deadlock, livelock, priority inversion,… (More)