Sciweavers

1095 search results - page 5 / 219
» Efficient Algorithms for Average Completion Time Scheduling
Sort
View
NIPS
2008
14 years 11 months ago
An Online Algorithm for Maximizing Submodular Functions
We present an algorithm for solving a broad class of online resource allocation . Our online algorithm can be applied in environments where abstract jobs arrive one at a time, and...
Matthew J. Streeter, Daniel Golovin
100
Voted
FSKD
2005
Springer
143views Fuzzy Logic» more  FSKD 2005»
15 years 3 months ago
Energy Efficient Dynamic Cluster Based Clock Synchronization for Wireless Sensor Network
Core operations (e.g. TDMA scheduler, synchronized sleep period, data aggregation) of many proposed protocols for different layer of sensor network necessitate clock synchronizatio...
Md. Mamun-Or-Rashid, Choong Seon Hong, Jinsung Cho
CONPAR
1992
15 years 1 months ago
Analysis of an Efficient Distributed Algorithm for Mutual Exclusion (Average-Case Analysis of Path Reversal)
The algorithm designed in [12, 15] was the very first distributed algorithm to solve the mutual exclusion problem in complete networks by using a dynamic logical tree structure as...
Christian Lavault
54
Voted
SODA
2010
ACM
163views Algorithms» more  SODA 2010»
15 years 7 months ago
SRPT is 1.86-Competitive for Completion Time Scheduling
Christine Chung, Tim Nonner, Alexander Souza
87
Voted
DATE
2009
IEEE
133views Hardware» more  DATE 2009»
15 years 4 months ago
Energy efficient multiprocessor task scheduling under input-dependent variation
— In this paper, we propose a novel, energy aware scheduling algorithm for applications running on DVS-enabled multiprocessor systems, which exploits variation in execution times...
Jason Cong, Karthik Gururaj