Sciweavers

2254 search results - page 440 / 451
» Computing the minimal covering set
Sort
View
STOC
2006
ACM
121views Algorithms» more  STOC 2006»
14 years 3 months ago
On adequate performance measures for paging
Memory management is a fundamental problem in computer architecture and operating systems. We consider a two-level memory system with fast, but small cache and slow, but large mai...
Konstantinos Panagiotou, Alexander Souza
RTSS
2005
IEEE
14 years 3 months ago
Enhanced EDF Scheduling Algorithms for Orchestrating Network-Wide Active Measurements
Monitoring network status such as end-to-end delay, jitter, and available bandwidth is important to support QoS-sensitive applications and timely detection of network anomalies li...
Prasad Calyam, Chang-Gun Lee, Phani Kumar Arava, D...
VISUALIZATION
2005
IEEE
14 years 3 months ago
Distributed Data Management for Large Volume Visualization
We propose a distributed data management scheme for large data visualization that emphasizes efficient data sharing and access. To minimize data access time and support users wit...
Jinzhu Gao, Jian Huang, C. Ryan Johnson, Scott Atc...
SENSYS
2005
ACM
14 years 3 months ago
Sympathy for the sensor network debugger
Being embedded in the physical world, sensor networks present a wide range of bugs and misbehavior qualitatively different from those in most distributed systems. Unfortunately, d...
Nithya Ramanathan, Kevin K. Chang, Rahul Kapur, Le...
EUROPAR
2005
Springer
14 years 3 months ago
Hierarchical Scheduling for Moldable Tasks
The model of moldable task (MT) was introduced some years ago and has been proved to be an efficient way for implementing parallel applications. It considers a target application ...
Pierre-François Dutot