Article

Free access

Job scheduling in rings

Authors:

Perry Fizzano,

David Karger,

Clifford Stein,

Joel WeinAuthors Info & Claims

SPAA '94: Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures

Pages 210 - 219

https://doi.org/10.1145/181014.181333

Published: 01 August 1994 Publication History

PDF eReader

References

[1]

W. Aiello, B. Awerbuch, B. Maggs, and S. Rao. Approximate load balancing on dynamic and asynchronous networks. In Proceedings of the 25th Annual A CM Symposium on Theory of Computing, pages 632-641, 1993.

Digital Library

Google Scholar

[2]

F. Alien, M. Burke, P. Charles, R. Cytron, and J. Ferrante. An overview of the ptran analysis system for multiprocessing. Journal o:f Parallel and Distributed Computing, 5:617-640, 1988.

Digital Library

Google Scholar

[3]

H. Attiya, M. Snir, and M. Warmuth. Computing on an anonymous ring. Journal of the A CM, 35(4):845-875, 1988.

Digital Library

Google Scholar

[4]

B. Awerbuch, S. Kutten, and D.Peleg. Competetive distributed job scheduling. In Proceedings of the 2#th Annual A CM Symposium on Theory of Computing, pages 571-580, 1992.

Digital Library

Google Scholar

[5]

L. Bhuyan, D. Ghosal, and Q. Yang. Approximate analysis of single and multiple ring networks. IEEE Transachons on Computers, 38:1027-1040, 1989.

Digital Library

Google Scholar

[6]

H. Choi and A. Esfahanian. A message routing strategy for multicomputer systems. Networks, 22:627-646, 1992.

Crossref

Google Scholar

[7]

X. Deng, H. Liu, J. Long, and B. Xiao. Deterministic load balancing in computer networks. In _Proceedings of Znd IEEE Symposium on Parallel and Distributed Processing, 1992.

Google Scholar

[8]

M. Herlihy, B. Lim, and N. Shavit. Low contention loadbalancing on large-scale multiprocessors. In Proceedings of the 1992 ACM Symposium on Parallel Algorithms and Architectures, pages 219-227, 1992.

Digital Library

Google Scholar

[9]

Y. Hong and T. Payne. Parallel sorting in a ring network of processors. IEEE Transactions on Computers, 38:458-464, 1989.

Digital Library

Google Scholar

[10]

S. Flynn Hummel and E. Schonberg. Low-overhead scheduling of nested parallelism. IBM Journal o} Research and Development, 35(5/6):743-765, 1991.

Digital Library

Google Scholar

[11]

S. Flynn Hummel, E. Schonberg, and L. E. Flynn. Factoring: A practical and robust method for scheduling parallel loops. Comm. of the A CM, 35(8):90-101, 1992.

Digital Library

Google Scholar

[12]

D. Hutchinson. Local Area Network Architectures. Addison- Wesley, 1988.

Digital Library

Google Scholar

[13]

H. Kanada. Construction of a distributed computer network containing ring connections. In Systems and Computers in Japan, pages 25-34, 1993.

Crossref

Google Scholar

[14]

E.L. LaMer, J.K. Lenstra, A.H.G. Rinooy Kan, and D.B. Shmoys. Sequencing and scheduling: Algorithms and complexity. In S.C. Graves, A.H.G. Rinnooy Kan, and P.H. Zipkin, editors, Handbooks in Operahons Research and Management Science, Vol 4., Logistics of Production and Inventory, pages pp 445-522.

Google Scholar

[15]

F. T. Leighton. An Introduction to Parallel Algomthms and Architectures. Morgan Kaufmann, San Mateo, CA, 1991.

Digital Library

Google Scholar

[16]

Y. Mansour and L. Schulman. Sorting on a ring of processors. Journal of Algorithms, 11:622-630, 1990.

Digital Library

Google Scholar

[17]

C. A. Phillips, C. Stein, and J. Wein. Task scheduling in networks. In Proceedings of the #th Scandinawan Workshop on Algorithm Theory, July 1994. To appear.

Digital Library

Google Scholar

[18]

C. Polychronopoulos and D. Kuck. Guided self-scheduling: A practical scheduling scheme for parallel computers. IEEE Transactions on Computers, 12:1425-1439, 1987.

Digital Library

Google Scholar

[19]

J. Rothnie. Kendall square research introduction to the ksrl. In Dartmouth Institute for Advanced Graduate Studies in Parallel Computation, pages 200-210, 1992.

Google Scholar

[20]

W. Sung and S. Mitra. Multiprocessor implementation of recursive least squares algorithms using a parallel block processing method. In IEEE International Symposium on Czrcults and Systems, pages 2939-2942, 1991.

Crossref

Google Scholar

[21]

W. Sung, S. Mitra, and K. Num. Mapping locally recursive sfgs upon a multiprocessor system in a ring network. In Proceedings of the International Conference on Apphcation Specific Array Processors, pages 560-573, 1992.

Crossref

Google Scholar

[22]

J. Takahashi, S. Hattori, T. Kimura, and A. Iwata. A ring array processor for highly parallel dynamic time warping. IEEE Transactions on Acoustics, Speech and Signal Processing, 34:1310-1318, 1986.

Crossref

Google Scholar

[23]

A.S. Ta.nenbaum. Computer Networks. Prentice Hall, 1989.

Google Scholar

Cited By

View all

Gehrke JPlaxton CRajaraman R(2005)Rapid convergence of a local load balancing algorithm for asynchronous ringsDistributed Algorithms10.1007/BFb0030677(81-95)Online publication date: 20-Jun-2005
https://doi.org/10.1007/BFb0030677
Phillips CStein CWein J(2005)Task scheduling in networksAlgorithm Theory — SWAT '9410.1007/3-540-58218-5_27(290-301)Online publication date: 30-May-2005
https://doi.org/10.1007/3-540-58218-5_27
Georgiades SMavronicolas MSpirakis P(2003)Optimal, distributed decision-making: The case of no communicationFundamentals of Computation Theory10.1007/3-540-48321-7_24(293-303)Online publication date: 3-Jun-2003
https://doi.org/10.1007/3-540-48321-7_24
Show More Cited By

Index Terms

Job scheduling in rings
1. Software and its engineering
  1. Software organization and properties
    1. Contextual software domains
      1. Operating systems
        Process management
        Scheduling
2. Theory of computation
  1. Design and analysis of algorithms
    1. Approximation algorithms analysis
      1. Scheduling algorithms
    2. Online algorithms
      1. Online learning algorithms
        Scheduling algorithms
  2. Theory and algorithms for application domains
    1. Machine learning theory
      1. Reinforcement learning
        Sequential decision making

Recommendations

Parallel job scheduling algorithms
Effective ensembles of heuristics for scheduling flexible job shop problem with new job insertion

Flexible job shop scheduling problem.Ensembles of heuristics.Re-scheduling for new job insertion.Multiple objectives scheduling problem. This study investigates the flexible job shop scheduling problem (FJSP) with new job insertion. FJSP with new job ...
A GEP-based reactive scheduling policies constructing approach for dynamic flexible job shop scheduling problem with job release dates

Flexible job shop scheduling problem (FJSSP) is generalization of job shop scheduling problem (JSSP), in which an operation may be processed on more than one machine each of which has the same function. Most previous researches on FJSSP assumed that all ...

Comments

Information & Contributors

Information

Published In

SPAA '94: Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures

August 1994

374 pages

ISBN:0897916719

DOI:10.1145/181014

Chairmen:
Lawrence Snyder
Univ. of Washington, Seattle
,
Charles E. Leiserson
Massachusetts Institute of Technology, Cambridge

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 August 1994

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

6SPAA94

Sponsor:

European Comp Soc
SIGACT
SIGARCH

6SPAA94: 6th Annual ACM Symposium on Parallel Algorithms and Architectures

June 27 - 29, 1994

New Jersey, Cape May, USA

Acceptance Rates

Overall Acceptance Rate 447 of 1,461 submissions, 31%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
36
Total Downloads

Downloads (Last 12 months)11
Downloads (Last 6 weeks)2

Reflects downloads up to 10 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Gehrke JPlaxton CRajaraman R(2005)Rapid convergence of a local load balancing algorithm for asynchronous ringsDistributed Algorithms10.1007/BFb0030677(81-95)Online publication date: 20-Jun-2005
https://doi.org/10.1007/BFb0030677
Phillips CStein CWein J(2005)Task scheduling in networksAlgorithm Theory — SWAT '9410.1007/3-540-58218-5_27(290-301)Online publication date: 30-May-2005
https://doi.org/10.1007/3-540-58218-5_27
Georgiades SMavronicolas MSpirakis P(2003)Optimal, distributed decision-making: The case of no communicationFundamentals of Computation Theory10.1007/3-540-48321-7_24(293-303)Online publication date: 3-Jun-2003
https://doi.org/10.1007/3-540-48321-7_24
Barrows MGregory DGao LRosenberg ACohen P(1999)An empirical study of dynamic scheduling on rings of processorsParallel Computing10.1016/S0167-8191(99)00039-325:9(1063-1079)Online publication date: 1-Sep-1999
https://dl.acm.org/doi/10.1016/S0167-8191%2899%2900039-3
Adler MSitaraman RRosenberg AUnger WMiller GGibbons P(1998)Scheduling time-constrained communication in linear networksProceedings of the tenth annual ACM symposium on Parallel algorithms and architectures10.1145/277651.277693(269-278)Online publication date: 1-Jun-1998
https://dl.acm.org/doi/10.1145/277651.277693
Muthukrishnan SRajaraman RMiller GGibbons P(1998)An adversarial model for distributed dynamic load balancingProceedings of the tenth annual ACM symposium on Parallel algorithms and architectures10.1145/277651.277669(47-54)Online publication date: 1-Jun-1998
https://dl.acm.org/doi/10.1145/277651.277669
Gao Rosenberg (1994)On balancing computational load on rings of processorsProceedings of the 1994 6th IEEE Symposium on Parallel and Distributed Processing10.1109/SPDP.1994.346132(478-483)Online publication date: 26-Oct-1994
https://dl.acm.org/doi/10.1109/SPDP.1994.346132

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Parallel job scheduling algorithms

Effective ensembles of heuristics for scheduling flexible job shop problem with new job insertion

A GEP-based reactive scheduling policies constructing approach for dynamic flexible job shop scheduling problem with job release dates