P. Fizzano, D. Karger, C. Stein, and J. Wein. Job scheduling in rings. In Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 210--219, June 1994.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....between the number of tokens at any two nodes is at most one. In this paper, we study static load balancing on a ring network. The ring network has been studied extensively in both theory and practice. Several problems arising in distributed computing have been addressed on the ring (see [5, 13, 14, 19] for a variety of examples) From a practical perspective, the ring is an essential component of several parallel and distributed architectures [17, 25] Our main contribution is a tight analysis of a simple algorithm that is based on the local balancing approach. We show that this algorithm, ....

P. Fizzano, D. Karger, C. Stein, and J. Wein. Job scheduling in rings. In Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 210--219, June 1994.

....size of the network. Their results are not applicable in our model, however, because their model places no bound on the amount of information or load that can be sent along any edge at any time. In addition, their work involves certain non local operations that are inefficient in our model. See [4, 12, 25] for more work on this problem. The unbounded versus unit capacity assumption on the model of communication makes for a big difference in the flavor of the problems. For instance, cut capacity provides an upper bound on the number of tokens (amount of flow) that any algorithm may remove from a ....

P. Fizzano, D. Karger, C. Stein, and J. Wein. Job scheduling in rings. In Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 210--219, June 1994. Journal version to appear in Journal of Parallel and Distributed Computing.

....between the number of tokens at any two nodes is at most one. In this paper, we study static load balancing on a ring network. The ring network has been studied extensively in both theory and practice. Several problems arising in distributed computing have been addressed on the ring (see [5, 13, 14, 19] for a variety of examples) From a practical perspective, the ring is an essential component of several parallel and distributed architectures [17, 25] Our main contribution is a tight analysis of a simple algorithm that is based on the local balancing approach. We show that this algorithm, ....

P. Fizzano, D. Karger, C. Stein, and J. Wein. Job scheduling in rings. In Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 210--219, June 1994.

....that is a fixed percentage, r, from the optimum. Such methods are referred to as r approximation algorithms. For example Shmoys et al. 1994) propose several poly logarithmic approximations of the optimal P J schedule which are evaluated in terms of their worst case relative error, while Fizzano et al. 1997) present a series of distributed approximation algorithms which configure the machines in a ring architecture. The most recent contribution in this area (Williamson et al. 1997) provides the first non page (6) A state of the art review of job shop scheduling techniques 03 10 98 trivial ....

Fizzano, P., Stein, C., Karger, D. and Wein, J. (1997) Job Scheduling in Rings, Journal of Parallel and Distributed Computing, 45(2), 122-133.

....between the number of tokens at any two nodes is at most one. In this paper, we study static load balancing on a ring network. The ring network has been studied extensively in both theory and practice. Several problems arising in distributed computing have been addressed on the ring (see [5, 13, 14, 19] for a variety of examples) From a practical perspective, the ring is an essential component of several parallel and distributed architectures [17, 25] Our main contribution is a tight analysis of a simple algorithm that is based on the local balancing approach. We show that this algorithm, ....

P. Fizzano, D. Karger, C. Stein, and J. Wein. Job scheduling in rings. In Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 210--219, June 1994.

....be described by just the number of jobs on a processor at a given time. We denote by j i the number of jobs currently on processor p i . The network model just described allows a machine to process a job on the same step that it passes a job. This model is the same as that in many previous papers [1, 3, 4, 5, 6] and is supported by current technology [2] Additional restrictions that we place on the model are that it takes unit time to traverse a network link and the capacity of each link is one job per time unit. This implies that a processor can pass one job to each neighbor in one time step but it can ....

P. Fizzano, D. Karger, C. Stein, and J. Wein. Job scheduling in rings. In Proceedings of the 6th ACM Symposium on Parallel Algorithms and Architectures, 1994.

....of feedback based approaches. In addition they derived off line approximation results similar to those of Deng et. al [2, 20] Alon et al. 1] proved an Omega Gamma 18 m) lower bound on the performance of any distributed scheduler that is trying to minimize schedule length. Fizzano et al. [5] give a distributed 4:3 approximation algorithm for schedule length in the special case in which the network is a ring. Our work differs from these papers by focusing on the centralized off line problem and by giving approximations of higher quality. In addition, our approximation algorithms work ....

P. Fizzano, D. Karger, C. Stein, and J. Wein. Job scheduling in rings. In Proceedings of the 1994 ACM Symposium on Parallel Algorithms and Architectures, pages 210--219, june 1994.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC