505 search results - page 31 / 101 » Dynamic Scheduling with Process Migration |
123
click to vote
HPDC
2006
IEEE
15 years 8 months ago
2006
IEEE
Consider a workload in which massively parallel tasks that require large resource pools are interleaved with short tasks that require fast response but consume fewer resources. We...
106
click to vote
EOR
2006
15 years 2 months ago
2006
In this paper, we develop an acyclic network of queues for the design of a dynamic flow shop, where each service station represents a machine. The orders arrive at the input stati...
SPAA
1999
ACM
15 years 6 months ago
1999
ACM
Clustering supportwith a single-systemimagefor large-scaleWeb serversis important to improve the systemscalability in processing alargenumberof concurrentrequestsfrom Internet,esp...
105
click to vote
CD
2004
Springer
15 years 7 months ago
2004
Springer
Development and deployment via components offers the possibility of prolific software reuse. However, to achieve this potential in a component-rich environment, it is necessary to...
146
click to vote
ISSS
1995
IEEE
15 years 5 months ago
1995
IEEE
To construct complete systems on silicon, application speci c DSP accelerators are needed to speed up the execution of high throughput DSP algorithms. In this paper, a methodology...