Sciweavers

466 search results - page 18 / 94
» Using Queue Time Predictions for Processor Allocation
Sort
View
100
Voted
ISOLA
2010
Springer
14 years 11 months ago
Worst-Case Analysis of Heap Allocations
In object oriented languages, dynamic memory allocation is a fundamental concept. When using such a language in hard real-time systems, it becomes important to bound both the worst...
Wolfgang Puffitsch, Benedikt Huber, Martin Schoebe...
89
Voted
ASAP
2002
IEEE
85views Hardware» more  ASAP 2002»
15 years 5 months ago
Predictable Instruction Caching for Media Processors
The determinism of instruction cache performance can be considered a major problem in multi-media devices which hope to maximise their quality of service. If instructions are evic...
James Irwin, David May, Henk L. Muller, Dan Page
NIPS
1996
15 years 1 months ago
Predicting Lifetimes in Dynamically Allocated Memory
Predictions oflifetimesofdynamicallyallocated objects can be used to improve time and space e ciency of dynamic memory management in computer programs. Barrett and Zorn 1993] used...
David A. Cohn, Satinder P. Singh
ISCA
2005
IEEE
144views Hardware» more  ISCA 2005»
15 years 6 months ago
Scalable Load and Store Processing in Latency Tolerant Processors
Memory latency tolerant architectures support thousands of in-flight instructions without scaling cyclecritical processor resources, and thousands of useful instructions can compl...
Amit Gandhi, Haitham Akkary, Ravi Rajwar, Srikanth...
IPPS
1998
IEEE
15 years 4 months ago
Predicting the Running Times of Parallel Programs by Simulation
Predicting the running time of a parallel program is useful for determining the optimal values for the parameters of the implementation and the optimal mapping of data on processo...
Radu Rugina, Klaus E. Schauser