1095 search results - page 96 / 219 » Efficient Algorithms for Average Completion Time Scheduling |
111
click to vote
IEEEPACT
1998
IEEE
15 years 2 months ago
1998
IEEE
In this paper, we present an efficient algorithm, called CASS-II, for task clustering without task duplication. Unlike the DSC algorithm, which is empirically the best known algor...
TPDS
1998
14 years 9 months ago
1998
—Relational Coarsest Partition Problems (RCPPs) play a vital role in verifying concurrent systems. It is known that RCPPs are 3-complete and hence it may not be possible to desig...
CCGRID
2009
IEEE
14 years 7 months ago
2009
IEEE
We propose information aggregation as a method for summarizing the resource-related information, used by the task scheduler. Through this method the information of a set of resour...
111
click to vote
CODES
2003
IEEE
15 years 3 months ago
2003
IEEE
In this paper, we describe a new methodology based on game theory for minimizing the average power of a circuit during scheduling in behavioral synthesis. The problem of schedulin...
MASCOTS
2010
14 years 11 months ago
2010
Execution and communication traces are central to performance modeling and analysis. Since the traces can be very long, meaningful compression and extraction of representative beha...