16128 search results - page 2619 / 3226 » Distributed network scheduling |
187
click to vote
JCSS
2008
15 years 7 months ago
2008
Dynamically allocating computing nodes to parallel applications is a promising technique for improving the utilization of cluster resources. Detailed simulations can help identify...
195
click to vote
IS
2006
15 years 7 months ago
2006
The objective of this study is to determine the right cycle management policy to service periodic soft real-time disk retrieval. Cycle based disk scheduling provides an effective ...
241
click to vote
MOR
2008
15 years 7 months ago
2008
The flow set with partial order is a mixed-integer set described by a budget on total flow and a partial order on the arcs that may carry positive flow. This set is a common substr...
226
click to vote
TVLSI
2008
15 years 7 months ago
2008
This paper proposes a high-performance scalable quality-of-service (QoS)-aware memory controller for the packet memory where packet data are stored in network routers. A major chal...
211
click to vote
ETT
2002
15 years 7 months ago
2002
In computer networks, the Strict Priority (SP) discipline is perhaps the most common and simplest method to schedule packets from different classes of applications, each with diver...