1502 search results - page 51 / 301 » Node weighted scheduling |
137
click to vote
FMSD
2002
15 years 1 months ago
2002
We present a new technique for verification of complex hardware devices that allows both generality andahighdegreeofautomation.Thetechniqueisbasedonournewwayofconstructinga"li...
128
click to vote
IPPS
2007
IEEE
15 years 8 months ago
2007
IEEE
Heterogeneity has been considered in scheduling, but without taking into account the temporal variation of completion times of the sub-tasks for a divisible, independent task. In ...
91
Voted
DAGSTUHL
2006
15 years 3 months ago
2006
We study the online version of the classical parallel machine scheduling problem to minimize the total weighted completion time from a new perspective: We assume that the data of ...
121
Voted
ICDCS
2006
IEEE
15 years 8 months ago
2006
IEEE
— We consider applications of sensor networks wherein data packets generated by every node have to reach the base station. This results in a many-to-one communication paradigm re...
102
click to vote
HOTOS
2003
IEEE
15 years 7 months ago
2003
IEEE
Upgrading the software of long-lived distributed systems is difficult. It is not possible to upgrade all the nodes in a system at once, since some nodes may be down and halting t...