Sciweavers

3202 search results - page 12 / 641
» Memory access scheduling
Sort
View
ICPP
1998
IEEE
13 years 12 months ago
A memory-layout oriented run-time technique for locality optimization
Exploiting locality at run-time is a complementary approach to a compiler approach for those applications with dynamic memory access patterns. This paper proposes a memory-layout ...
Yong Yan, Xiaodong Zhang, Zhao Zhang
PLDI
1994
ACM
13 years 11 months ago
Memory Access Coalescing: A technique for Eliminating Redundant memory Accesses
As microprocessor speeds increase, memory bandwidth is increasing y the performance bottleneck for microprocessors. This has occurred because innovation and technological improvem...
Jack W. Davidson, Sanjay Jinturkar
DATE
2010
IEEE
107views Hardware» more  DATE 2010»
14 years 24 days ago
Worst case delay analysis for memory interference in multicore systems
Abstract—Employing COTS components in real-time embedded systems leads to timing challenges. When multiple CPU cores and DMA peripherals run simultaneously, contention for access...
Rodolfo Pellizzoni, Andreas Schranzhofer, Jian-Jia...
HPDC
2006
IEEE
14 years 1 months ago
Adaptive I/O Scheduling for Distributed Multi-applications Environments
The aIOLi project aims at optimizing the I/O accesses within the cluster by providing a simple POSIX API, thus avoiding the constraints to use a dedicated parallel I/O library. Th...
Adrien Lebre, Yves Denneulin, Guillaume Huard, Prz...
OSDI
1994
ACM
13 years 9 months ago
Lottery Scheduling: Flexible Proportional-Share Resource Management
This paper presents lottery scheduling, a novel randomized resource allocation mechanism. Lottery scheduling provides efficient, responsive control over the relative execution rat...
Carl A. Waldspurger, William E. Weihl