Sciweavers

1901 search results - page 19 / 381
» Models and Scheduling Mechanisms for Global Computing Applic...
Sort
View
MEMOCODE
2006
IEEE
15 years 5 months ago
Latency-insensitive design and central repetitive scheduling
The theory of latency-insensitive design (LID) was recently invented to cope with the time closure problem in otherwise synchronous circuits and programs. The idea is to allow the...
Julien Boucaron, Robert de Simone, Jean-Vivien Mil...
NOSSDAV
1995
Springer
15 years 2 months ago
Workstation Video Playback Performance with Competitive Process Load
While many researchers believe that multimedia applications are best managed with hard, real-time scheduling mechanisms, models based on application-level adaptation with relaxed s...
Kevin R. Fall, Joseph Pasquale, Steven McCanne
ALDT
2009
Springer
172views Algorithms» more  ALDT 2009»
15 years 5 months ago
On Multi-dimensional Envy-Free Mechanisms
Traditional performance analysis of approximation algorithms considers overall performance, while economic fairness analysis focuses on the individual performance each user receiv...
Ahuva Mu'alem
VLSID
2002
IEEE
98views VLSI» more  VLSID 2002»
15 years 11 months ago
On Test Scheduling for Core-Based SOCs
We present a mathematical model for the problem of scheduling tests for core-based system-on-chip (SOC) VLSI designs. Given a set of tests for each core in the SOC and a set of te...
Sandeep Koranne
87
Voted
MOBISYS
2005
ACM
15 years 10 months ago
Horde: separating network striping policy from mechanism
Inverse multiplexing, or network striping, allows the construction of a high-bandwidth virtual channel from a collection of multiple low-bandwidth network channels. Striping syste...
Asfandyar Qureshi, John V. Guttag