3844 search results - page 289 / 769 » Distributed Meeting Scheduling |
202
click to vote
ICCCN
2008
IEEE
16 years 1 months ago
2008
IEEE
—We investigate the p-percent coverage problem in this paper and propose two algorithms to prolong network lifetime based on the fact that for some applications full coverage is ...
166
Voted
EGC
2005
Springer
16 years 7 days ago
2005
Springer
In multicluster systems, and more generally, in grids, jobs may require co-allocation, i.e., the simultaneous allocation of resources such as processors and input files in multipl...
174
click to vote
ISHPC
2003
Springer
15 years 12 months ago
2003
Springer
Most cluster systems used in high performance computing do not allow process relocation at run-time. Finding an allocation that results in minimal completion time is NP-hard and (n...
150
click to vote
SIGMETRICS
1999
ACM
15 years 11 months ago
1999
ACM
In this paperweconsidertheproblemof schedulingdifferentclasses of customerson multiple distributed serversto minimize an objective function basedon per-classmeanresponsetimes.This...
171
click to vote
IPPS
1996
IEEE
15 years 11 months ago
1996
IEEE
In a shared-memory multiprocessor system, it is possible that certain synchronization operations are redundant -that is, their corresponding sequencing requirements are enforced c...