Sciweavers

165 search results - page 6 / 33
» Thread Cluster Memory Scheduling
Sort
View
IPPS
2005
IEEE
15 years 3 months ago
Fault-Tolerant Parallel Applications with Dynamic Parallel Schedules
Commodity computer clusters are often composed of hundreds of computing nodes. These generally off-the-shelf systems are not designed for high reliability. Node failures therefore...
Sebastian Gerlach, Roger D. Hersch
SBACPAD
2007
IEEE
121views Hardware» more  SBACPAD 2007»
15 years 3 months ago
DTA-C: A Decoupled multi-Threaded Architecture for CMP Systems
One way to exploit Thread Level Parallelism (TLP) is to use architectures that implement novel multithreaded execution models, like Scheduled DataFlow (SDF). This latter model pro...
Roberto Giorgi, Zdravko Popovic, Nikola Puzovic
ETFA
2006
IEEE
15 years 3 months ago
Memory-Aware Feedback Scheduling of Control Tasks
This paper presents the incorporation of an auto-tuning real-time garbage collector into a feedback-based on-line scheduling system. The studied feedback scheduler is designed to ...
Sven Gestegard Robertz, Dan Henriksson, Anton Cerv...
ISORC
2006
IEEE
15 years 3 months ago
Real-Time Garbage Collection for Java
Automatic memory management or garbage collection greatly simplifies the development of large systems. However, garbage collection is usually not used in real-time systems due to...
Martin Schoeberl
CLUSTER
2003
IEEE
15 years 2 months ago
Implications of a PIM Architectural Model for MPI
Memory may be the only system component that is more commoditized than a microprocessor. To simultaneously exploit this and address the impending memory wall, processing in memory...
Arun Rodrigues, Richard C. Murphy, Peter M. Kogge,...