Sciweavers

466 search results - page 71 / 94
» Reduce, reuse
Sort
View
IPPS
1998
IEEE
14 years 26 days ago
Memory Hierarchy Management for Iterative Graph Structures
The increasing gap in processor and memory speeds has forced microprocessors to rely on deep cache hierarchies to keep the processors from starving for data. For many applications...
Ibraheem Al-Furaih, Sanjay Ranka
MICRO
1998
IEEE
129views Hardware» more  MICRO 1998»
14 years 26 days ago
A Bandwidth-efficient Architecture for Media Processing
Media applications are characterized by large amounts of available parallelism, little data reuse, and a high computation to memory access ratio. While these characteristics are p...
Scott Rixner, William J. Dally, Ujval J. Kapasi, B...
ICSE
1997
IEEE-ACM
14 years 23 days ago
Characterizing and Modeling the Cost of Rework in a Library of Reusable Software Components
1 In this paper we characterize and model the cost of rework in a Component Factory (CF) organization. A CF is responsible for developing and packaging reusable software components...
Victor R. Basili, Steven E. Condon, Khaled El Emam...
SIGMETRICS
1994
ACM
113views Hardware» more  SIGMETRICS 1994»
14 years 21 days ago
Shade: A Fast Instruction-Set Simulator for Execution Profiling
Shade is an instruction-set simulator and custom trace generator. Application programs are executed and traced under the control of a user-supplied trace analyzer. To reduce commu...
Robert F. Cmelik, David Keppel
CCGRID
2009
IEEE
14 years 19 days ago
Hierarchical Caches for Grid Workflows
From personal software to advanced systems, caching mechanisms have steadfastly been a ubiquitous means for reducing workloads. It is no surprise, then, that under the grid and clu...
David Chiu, Gagan Agrawal