skip to main content
10.1145/1500774.1500862acmotherconferencesArticle/Chapter ViewAbstractPublication PagesafipsConference Proceedingsconference-collections
research-article
Free access

Distributed scheduling of resources on interconnection networks

Published: 07 June 1982 Publication History

Abstract

In this paper, we have studied the distributed scheduling of resources on interconnection networks. The resource scheduling problem is different from the conventional address mapping problem on interconnection networks because a request is not directed towards a particular destination address but to any one of a pool of destination addresses for free resources. To design an algorithm with the minimum transfer of control signals, priority is associated with the scheduling of multiple requests. This is illustrated by the distributed cross-bar switch which has one signal line in each direction of a switch node. For complete asynchronous operation, more signal lines are needed. This is illustrated by the distributed Omega and binary n-cube networks. Each exchange box in the network operates independently to resolve conflicts. The performance of the distributed scheduling algorithm for the Omega and cube networks is compared against the optimal centralized scheduling algorithm which has about 1% average blocking probability. The performance degradation is less than 20% in all cases. The theory of the design can be applied to other interconnection networks.

References

[1]
Barnes, G. H., and S. F. Lundstrom. "Design and Validation of a Connection Network for Many-Processor Multiprocessor Systems." IEEE Computer, 14 (1981) pp. 31--41.
[2]
Batcher, K. E., "STARAN Parallel Processing System Hardware," Proc. of AFIPS 1974 National Computer Conf., Vol. 43, pp. 405--410, May 1974.
[3]
K. E. Batcher, "The Flip Network in STARAN," Proc. of 1976 Int'l Conf. on Parallel Processing, Michigan, pp. 65--71, 1976.
[4]
Burroughs Corp., Final Report, Numerical Aerodynamic Simulation Facility Feasibility Study, NASA Contractor Reports CR152284 and CR152285, Burroughs Corp., Paoli, PA, March 1979.
[5]
Feng, T. "Data Manipulating Functions in Parallel Processors and Their Implications." IEEE Trans. Computer, Vol. C-23, No. 3, pp. 309--318, Mar. 1974.
[6]
Franklin, M. A. "VLSI Performance Comparison of Banyan and Cross-bar Communication Networks." Proc. of Workshop on Interconnection Networks, pp. 20--28, Apr. 1980.
[7]
Goke, L. R., and G. J. Lipovski. "Banyan Networks for Partitioning Multiprocessor Systems," Proc. 1st Annual Comp. Architecture Conf., pp. 21--28, Dec. 1973.
[8]
Goke, L. R., Banyan Networks for Partitioning Multiprocessor Systems Ph.D. Thesis, Univ. of Florida, 1976.
[9]
Jenevein, R., D. Degroot and G. J. Lipovski. "A Hardware Support Mechanism for Scheduling Resources in a Parallel Machine Environment." Proc. of 8th Annual Symposium on Computer Architecture, pp. 57--66, May 1981.
[10]
Kuck, D. J. "ILLIAC IV Software and Application Programming." IEEE Trans. on Comp., Vol. C-17, pp. 746--757, Aug. 1968.
[11]
Lawrie, D. "Access and Alignment of Data in an Array Processor." IEEE Trans. Computers, Vol. C-24, No. 12, pp. 215--255, Dec. 1975.
[12]
McDonald, W. C. and J. M. Williams, "The Advanced Data Processing Test Bed." Proc. of COMPSAC 78, pp. 346--351, March 1978.
[13]
Ornstein, S. M., et al., "Pluribus---A Reliable Multiprocessor." Proc. AFIPS 1975 National Computer Conference, AFIPS Press, Montvale, N.J., pp. 551--559, 1975.
[14]
Patel, J. H. "Performance of Processor-Memory Interconnections for Multiprocessors." IEEE Trans. on Computers, Vol. C-20, No. 10, pp. 771--780, Oct. 1981.
[15]
Pease, M. C. "The Indirect Binary n-cube Microprocessor Array," IEEE Trans. on Computers, Vol. C-26, No. 5, pp. 458--473, May 1977.
[16]
Rathi, B. D., A. R. Tripathi and G. J. Lipovski. "Hardwired Resource Allocators for Reconfigurable Architectures," Proc. of 1980 International Conference on Parallel Processing, pp. 109--117, Aug. 1980.
[17]
Sejnowski, M. C., et al. "Overview of the Texas Reconfigurable Array Computer." AFIPS Conference Proceedings, Vol. 49, pp. 631--642, 1980.
[18]
Siegel, H. J., and R. J. McMillen. "The Cube Network as a Distributed Processing Test Bed Switch." 2nd Int'l. Conf. on Dist. Comp. Sys., pp. 377--387, April 1981.
[19]
Siegel, H. J., and R. J. McMillen. "Using the Augmented Data Manipulator Network in PASM." IEEE Computer, Vol. 14, No. 2, pp. 25--33, Feb. 1981.
[20]
Stone, H. "Parallel Processing with the Perfect Shuffle." IEEE Trans. on Computers, Vol. C-20, No. 2, pp. 153--161, Feb. 1971.
[21]
Wu, C., and T. Y. Feng. "On a Class of Multistage Interconnection Networks." IEEE Trans. on Computers, Vol. C-29, No. 8, pp. 694--702, Aug. 1980.
[22]
Wulf, W. A., and C. G. Bell. "C.mmp---A Multi-mini Processor." Proc. AFIPS 1972 Fall Joint Comp. Conf., Vol. 41, AFIPS Press, Montvale, NJ, pp. 765--777, 1972.
[23]
Hicks, A., Resource Scheduling on Interconnection Networks. M.S. Thesis, Purdue University, 1982.

Cited By

View all
  • (1989)Resource Sharing Interconnection Networks in MultiprocessorsIEEE Transactions on Computers10.1109/12.873538:1(115-129)Online publication date: 1-Jan-1989
  • (1984)A Comparative Study of Distributed Resource Sharing on MultiprocessorsIEEE Transactions on Computers10.1109/TC.1984.500935633:8(700-711)Online publication date: 1-Aug-1984
  • (1982)PUMPS Architecture for Pattern Analysis and Image Database ManagementIEEE Transactions on Computers10.1109/TC.1982.167590631:10(969-983)Online publication date: 1-Oct-1982

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences
AFIPS '82: Proceedings of the June 7-10, 1982, national computer conference
June 1982
857 pages
ISBN:088283035X
DOI:10.1145/1500774
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]

Sponsors

  • AFIPS: American Federation of Information Processing Societies

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 07 June 1982

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Research-article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)31
  • Downloads (Last 6 weeks)8
Reflects downloads up to 19 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (1989)Resource Sharing Interconnection Networks in MultiprocessorsIEEE Transactions on Computers10.1109/12.873538:1(115-129)Online publication date: 1-Jan-1989
  • (1984)A Comparative Study of Distributed Resource Sharing on MultiprocessorsIEEE Transactions on Computers10.1109/TC.1984.500935633:8(700-711)Online publication date: 1-Aug-1984
  • (1982)PUMPS Architecture for Pattern Analysis and Image Database ManagementIEEE Transactions on Computers10.1109/TC.1982.167590631:10(969-983)Online publication date: 1-Oct-1982

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media