Sciweavers

1008 search results - page 122 / 202
» Minimizing Average Flow-Time
Sort
View
KDD
2003
ACM
162views Data Mining» more  KDD 2003»
16 years 1 months ago
Improving spatial locality of programs via data mining
In most computer systems, page fault rate is currently minimized by generic page replacement algorithms which try to model the temporal locality inherent in programs. In this pape...
Karlton Sequeira, Mohammed Javeed Zaki, Boleslaw K...
106
Voted
HPCA
2008
IEEE
16 years 1 months ago
Runahead Threads to improve SMT performance
In this paper, we propose Runahead Threads (RaT) as a valuable solution for both reducing resource contention and exploiting memory-level parallelism in Simultaneous Multithreaded...
Tanausú Ramírez, Alex Pajuelo, Olive...
HPCA
2001
IEEE
16 years 1 months ago
Dynamic Thermal Management for High-Performance Microprocessors
With the increasing clock rate and transistor count of today's microprocessors, power dissipation is becoming a critical component of system design complexity. Thermal and po...
David Brooks, Margaret Martonosi
86
Voted
MICCAI
2009
Springer
16 years 25 days ago
Lung Extraction, Lobe Segmentation and Hierarchical Region Assessment for Quantitative Analysis on High Resolution Computed Tomo
Abstract. Regional assessment of lung disease (such as chronic obstructive pulmonary disease) is a critical component to accurate patient diagnosis. Software tools than enable such...
James C. Ross, Raúl San José Est&eac...
102
Voted
PERCOM
2005
ACM
16 years 9 days ago
When Does Opportunistic Routing Make Sense?
Different opportunistic routing protocols have been proposed recently for routing in sensor networks. These protocols exploit the redundancy among nodes by using a node that is av...
Adam Wolisz, Jan M. Rabaey, Rahul C. Shah, Sven Wi...