Sciweavers

16128 search results - page 248 / 3226
» Distributed network scheduling
Sort
View
135
Voted
NOSSDAV
1995
Springer
15 years 7 months ago
Determining End-to-End Delay Bounds in Heterogeneous Networks
We define a class of Guaranteed Rate (GR) scheduling algorithms. The GR class includes Virtual Clock, Packet-byPacket Generalized Processor Sharing and Self Clocked Fair Queuing....
Pawan Goyal, Simon S. Lam, Harrick M. Vin
125
Voted
CN
2008
118views more  CN 2008»
15 years 3 months ago
Modeling and computing throughput capacity of wireless multihop networks
Capacity is an important property for QoS support in Mobile Ad Hoc Networks (MANETs) and has been extensively studied. However, most approaches rely on simplified models (e.g., pr...
Patrick Stuedi, Gustavo Alonso
119
Voted
CN
1999
91views more  CN 1999»
15 years 3 months ago
Universal Timestamp-Scheduling for real-time networks
Consider a network of computers interconnected by point-to-point communication channels. For each flow of packets through the network, the network reserves a fraction of the packe...
Jorge Arturo Cobb
IPPS
1998
IEEE
15 years 7 months ago
Processor Lower Bound Formulas for Array Computations and Parametric Diophantine Systems
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
Peter R. Cappello, Ömer Egecioglu
136
Voted
ICS
1995
Tsinghua U.
15 years 7 months ago
Run-Time Methods for Parallelizing Partially Parallel Loops
In this paper we give a new run–time technique for finding an optimal parallel execution schedule for a partially parallel loop, i.e., a loop whose parallelization requires syn...
Lawrence Rauchwerger, Nancy M. Amato, David A. Pad...