Sciweavers

950 search results - page 26 / 190
» Modified global k
Sort
View
CCR
2006
117views more  CCR 2006»
13 years 10 months ago
Efficient and decentralized computation of approximate global state
Abstract-- The need for efficient computation of approximate global state lies at the heart of a wide range of problems in distributed systems. Examples include routing in the Inte...
S. Keshav
COLT
2010
Springer
13 years 8 months ago
Learning with Global Cost in Stochastic Environments
We consider an online learning setting where at each time step the decision maker has to choose how to distribute the future loss between k alternatives, and then observes the los...
Eyal Even-Dar, Shie Mannor, Yishay Mansour
ECRTS
2009
IEEE
13 years 8 months ago
Implementation of a Speedup-Optimal Global EDF Schedulability Test
A recent result in [13] has demonstrated the existence of a sufficient global EDF schedulability test for sporadic task systems that makes the following guarantee: any task system...
Sanjoy K. Baruah, Vincenzo Bonifaci, Alberto March...
ECRTS
2007
IEEE
14 years 4 months ago
The Global Feasibility and Schedulability of General Task Models on Multiprocessor Platforms
Feasibility analysis determines (prior to system execution-time) whether a specified collection of hard-realtime jobs executed on a processing platform can meet all deadlines. In...
Nathan Fisher, Sanjoy K. Baruah
DATE
2006
IEEE
82views Hardware» more  DATE 2006»
14 years 4 months ago
Value-based bit ordering for energy optimization of on-chip global signal buses
In this paper, we present a technique that exploits the statistical behavior of data values transmitted on global signal buses to determine an energy-efficient ordering of bits t...
Krishnan Sundaresan, Nihar R. Mahapatra