Sciweavers

3202 search results - page 24 / 641
» Memory access scheduling
Sort
View
CCGRID
2009
IEEE
14 years 2 months ago
Improving Parallel Write by Node-Level Request Scheduling
In a cluster of multiple processors or cpu-cores, many processes may run on each compute node. Each process tends to issue contiguous I/O requests for snapshot, checkpointing or s...
Kazuki Ohta, Hiroya Matsuba, Yutaka Ishikawa
SIGMOD
2003
ACM
193views Database» more  SIGMOD 2003»
14 years 7 months ago
Chain : Operator Scheduling for Memory Minimization in Data Stream Systems
In many applications involving continuous data streams, data arrival is bursty and data rate fluctuates over time. Systems that seek to give rapid or real-time query responses in ...
Brian Babcock, Shivnath Babu, Mayur Datar, Rajeev ...
RTCSA
2008
IEEE
14 years 2 months ago
Scheduler-Assisted Prefetching: Efficient Demand Paging for Embedded Systems
In an attempt to substitute NOR flash with NAND flash and provide more memory to applications, embedded systems have to use demand paging. However, demand paging drastically degra...
Stanislav A. Belogolov, Jiyong Park, Jungkeun Park...
ISCAPDCS
2004
13 years 9 months ago
FG: A Framework Generator for Hiding Latency in Parallel Programs Running on Clusters
FG is a programming environment for asynchronous programs that run on clusters and fit into a pipeline framework. It enables the programmer to write a series of synchronous functi...
Thomas H. Cormen, Elena Riccio Davidson
HPCA
2012
IEEE
12 years 3 months ago
Staged Reads: Mitigating the impact of DRAM writes on DRAM reads
Main memory latencies have always been a concern for system performance. Given that reads are on the critical path for CPU progress, reads must be prioritized over writes. However...
Niladrish Chatterjee, Naveen Muralimanohar, Rajeev...