Sciweavers

5580 search results - page 33 / 1116
» Randomized priority algorithms
Sort
View
SIGMETRICS
2009
ACM
103views Hardware» more  SIGMETRICS 2009»
14 years 5 months ago
Restrained utilization of idleness for transparent scheduling of background tasks
A common practice in system design is to treat features intended to enhance performance and reliability as low priority tasks by scheduling them during idle periods, with the goal...
Ningfang Mi, Alma Riska, Xin Li, Evgenia Smirni, E...
ECRTS
2008
IEEE
14 years 29 days ago
A Schedulability Analysis of Deferrable Scheduling Using Patterns
The schedulability testing for the deferrable scheduling algorithm for fixed priority transactions (DS-FP) remains
Song Han, Deji Chen, Ming Xiong, Aloysius K. Mok
INFOCOM
2007
IEEE
14 years 5 months ago
Queuing Delays in Randomized Load Balanced Networks
—Valiant’s concept of Randomized Load Balancing (RLB), also promoted under the name ‘two-phase routing’, has previously been shown to provide a cost-effective way of implem...
Ravi Prasad, Peter J. Winzer, Sem C. Borst, Marina...
ICCAD
2003
IEEE
127views Hardware» more  ICCAD 2003»
14 years 8 months ago
A Probabilistic-Based Design Methodology for Nanoscale Computation
As current silicon-based techniques fast approach their practical limits, the investigation of nanoscale electronics, devices and system architectures becomes a central research p...
R. Iris Bahar, Joseph L. Mundy, Jie Chen
SIGMOD
2008
ACM
138views Database» more  SIGMOD 2008»
14 years 11 months ago
Sampling time-based sliding windows in bounded space
Random sampling is an appealing approach to build synopses of large data streams because random samples can be used for a broad spectrum of analytical tasks. Users are often inter...
Rainer Gemulla, Wolfgang Lehner