Sciweavers

740 search results - page 112 / 148
» Analysis of Scheduling Algorithms with Reservations
Sort
View
HIPC
2007
Springer
15 years 1 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
ICIP
2006
IEEE
15 years 11 months ago
Autonomous Detection of Dust Devils and Clouds on Mars
Acquisition of science in space applications is shifting from teleoperated gathering to an automated on-board analysis with improvements in the use of on-board memory, CPU, bandwi...
Alex Fukunaga, Andres Castano, Jeffrey J. Biesiade...
ASPLOS
2010
ACM
15 years 4 months ago
Analyzing multicore dumps to facilitate concurrency bug reproduction
Debugging concurrent programs is difficult. This is primarily because the inherent non-determinism that arises because of scheduler interleavings makes it hard to easily reproduc...
Dasarath Weeratunge, Xiangyu Zhang, Suresh Jaganna...
DIALM
2008
ACM
168views Algorithms» more  DIALM 2008»
14 years 11 months ago
Local broadcasting in the physical interference model
In this work we analyze the complexity of local broadcasting in the physical interference model. We present two distributed randomized algorithms: one that assumes that each node ...
Olga Goussevskaia, Thomas Moscibroda, Roger Watten...
SPAA
2004
ACM
15 years 3 months ago
Packet-mode policies for input-queued switches
This paper considers the problem of packet-mode scheduling of input queuedswitches. Packets have variable lengths, and are divided into cells of unit length. Each packet arrives t...
Dan Guez, Alexander Kesselman, Adi Rosén