1095 search results - page 77 / 219 » Efficient Algorithms for Average Completion Time Scheduling |
69
Voted
CORR
2007
Springer
14 years 10 months ago
2007
Springer
Abstract— This paper develops and compares two asynchronous distributed scheduling algorithms for multiple controlled searchlights in nonconvex polygonal environments. A searchli...
ECRTS
2002
IEEE
15 years 3 months ago
2002
IEEE
—Each processor in a uniform multiprocessor machine is characterized by a speed or computing capacity, with the interpretation that a job executing on a processor with speed s fo...
ASPDAC
2008
ACM
15 years 3 days ago
2008
ACM
This paper proposes a novel Behavioral Synthesis method that improves performance of synthesized circuits utilizing specialized functional units effectively. Specialized functional...
IPPS
2005
IEEE
15 years 3 months ago
2005
IEEE
The scheduler is a key component in determining the overall performance of a parallel computer, and as we show here, the schedulers in wide use today exhibit large unexplained gap...
STOC
1999
ACM
15 years 2 months ago
1999
ACM
We considered non-clairvoyant multiprocessor scheduling of jobs with arbitrary arrival times and changing execution characteristics. The problem has been studied extensively when ...