{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T22:25:52Z","timestamp":1757543152343},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1991,6,1]],"date-time":"1991-06-01T00:00:00Z","timestamp":675734400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int J Parallel Prog"],"published-print":{"date-parts":[[1991,6]]},"DOI":"10.1007\/bf01379319","type":"journal-article","created":{"date-parts":[[2005,4,2]],"date-time":"2005-04-02T00:14:50Z","timestamp":1112400890000},"page":"237-270","source":"Crossref","is-referenced-by-count":31,"title":["OREGAMI: Tools for mapping parallel computations to parallel architectures"],"prefix":"10.1007","volume":"20","author":[{"given":"Virginia M.","family":"Lo","sequence":"first","affiliation":[]},{"given":"Sanjay","family":"Rajopadhye","sequence":"additional","affiliation":[]},{"given":"Samik","family":"Gupta","sequence":"additional","affiliation":[]},{"given":"David","family":"Keldsen","sequence":"additional","affiliation":[]},{"given":"Moataz A.","family":"Mohamed","sequence":"additional","affiliation":[]},{"given":"Bill","family":"Nitzberg","sequence":"additional","affiliation":[]},{"given":"Jan Arne","family":"Telle","sequence":"additional","affiliation":[]},{"given":"Xiaoxiong","family":"Zhong","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","unstructured":"M. Rosing, R. B. Schnabel, and R. P. Weaver, The Dino Parallel Programming Language, Technical Report CU-CS-457-90, Department of Computer Science, University of Colorado at Boulder (April 1990).","DOI":"10.21236\/ADA459435"},{"key":"CR2","unstructured":"M. H. Coffin, Par: An Approach to Architecture-independent Parallel Programming, Technical Report TR90-28, Department of Computer Science, University of Arizona (August 1990)."},{"issue":"1","key":"CR3","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1109\/TSE.1977.233840","volume":"3","author":"H. S. Stone","year":"1977","unstructured":"H. S. Stone, Multiprocessor Scheduling with the Aid of Network Flow Algorithms,IEEE Trans. on Software Engineering SE-3(1):85?93 (January 1977).","journal-title":"IEEE Trans. on Software Engineering SE"},{"key":"CR4","unstructured":"V. M. Lo, Temporal Communication Graphs: Lamport's Process-time Graphs Augmented for the Purpose of Mapping and Scheduling, Technical Report CIS-TR-92-04, University of Oregon (1992) (To appearJ. Parallel and Distrib. Computing.)"},{"issue":"7","key":"CR5","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1145\/359545.359563","volume":"21","author":"L. Lamport","year":"1978","unstructured":"L. Lamport, Time, Clocks, and the Ordering of Events in a Distributed System.Comm. of the ACM 21(7):558?565 (July 1978).","journal-title":"Comm. of the ACM"},{"issue":"1","key":"CR6","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1145\/2465.2467","volume":"28","author":"C. L. Seitz","year":"1985","unstructured":"C. L. Seitz, The Cosmic Cube,Comm. of the ACM 28(1):22?33 (January 1985).","journal-title":"Comm. of the ACM"},{"key":"CR7","doi-asserted-by":"crossref","unstructured":"C. D. Polychronopoulos,Parallel Programming and Compilers, Kluwer Academic Publishers (1988).","DOI":"10.1007\/978-1-4613-1077-8"},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"S. H. Bokhari,Assignment Problems in Parallel and Distributed Computing, Kluwer Academic Publishers (1987).","DOI":"10.1007\/978-1-4613-2003-6"},{"key":"CR9","unstructured":"F. Berman and B. Stramm, Prep-P: Evolution and Overview, Technical Report CS89-158, Department of Computer Science, University of California at San Diego (1989)."},{"issue":"11","key":"CR10","doi-asserted-by":"crossref","first-page":"1384","DOI":"10.1109\/12.8704","volume":"37","author":"V. M. Lo","year":"1988","unstructured":"V. M. Lo: Heuristic Algorithms for Task Assignment in Distributed Systems,IEEE Trans. on Comput. 37(11):1384?1397 (1988).","journal-title":"IEEE Trans. on Comput."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-8191(90)90115-P","volume":"13","author":"P. Sadayappan","year":"1990","unstructured":"P. Sadayappan, F. Ercal, and J. Ramanujam, Clustering Partitioning Approaches to Mapping Parallel Programs onto a Hypercube,Parallel Computing 13:1?16 (1990).","journal-title":"Parallel Computing"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-8191(86)90002-5","volume":"3","author":"J. C. Browne","year":"1986","unstructured":"J. C. Browne, Framework for Formulation and Analysis of Parallel Computation Structures,Parallel Computing 3:1?9 (1986).","journal-title":"Parallel Computing"},{"key":"CR13","unstructured":"F. Berman, Experience with an Automatic Solution to the Mapping Problem,The Characteristics of Parallel Algorithms, The MIT Pres, pp. 307?334 (1987)."},{"issue":"1","key":"CR14","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1109\/MC.1982.1653826","volume":"15","author":"L Snyder","year":"1982","unstructured":"L Snyder, Introduction to the Configurable, Highly Parallel Computer,Computer 15(1):47?56 (January 1982).","journal-title":"Computer"},{"key":"CR15","unstructured":"A. Wagner, S. Chanson, N. Goldstein, J. Jiang, H. Larsen, and H. Sreekantaswamy, TIPS: Transputer-based Interactive Parallelizing System, Technical Report, Department of Computer Science, University of British Columbia (1990)."},{"issue":"4","key":"CR16","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1109\/52.31648","volume":"6","author":"J. C. Browne","year":"1989","unstructured":"J. C. Browne, Code: A Unified Approach to Parallel Programming.IEEE Software 6(4):10?19 (July 1989).","journal-title":"IEEE Software"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1016\/0743-7315(90)90042-N","volume":"9","author":"H. El-Rewini","year":"1990","unstructured":"H. El-Rewini and T. G. Lewis, Scheduling Parallel Program Tasks onto Arbitrary Target Machines.J. of Parallel and Distrib. Computing 9:138?153 (1990).","journal-title":"J. of Parallel and Distrib. Computing"},{"key":"CR18","doi-asserted-by":"crossref","unstructured":"C. D. Polychronopoulos,Parallel Programming and Compilers, Kluwer Academic Publishers (1988).","DOI":"10.1007\/978-1-4613-1077-8"},{"key":"CR19","unstructured":"V. Sakar, Partitioning and Scheduling Parallel Programs for Execution on Multiprocessors, Technical Report, Ph.D. Thesis, Department of Computer Science, Stanford University (1987)."},{"key":"CR20","unstructured":"A. L. Rosenberg, Graph Embeddings 1988: Recent Breakthroughs New Directions, Technical Report 88-28, University of Massachusetts at Amherst (March 1988)."},{"issue":"5","key":"CR21","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1016\/0743-7315(87)90018-9","volume":"4","author":"F. Berman","year":"1987","unstructured":"F. Berman and L. Snyder, On Mapping Parallel Algorithms into Parallel Architectures,J. of Parallel and Distrib. Computing 4(5):439?458 (October 1987).","journal-title":"J. of Parallel and Distrib. Computing"},{"key":"CR22","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0167-8191(90)90105-I","volume":"14","author":"S. V. Rajopadhye","year":"1990","unstructured":"S. V. Rajopadhye and R. M. Fujimoto, Synthesizing Systolic Arrays from Recurrence Equations,Parallel Computing 14:163?189 (June 1990).","journal-title":"Parallel Computing"},{"issue":"6","key":"CR23","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1016\/0743-7315(86)90010-9","volume":"3","author":"Marina C. Chen","year":"1986","unstructured":"Marina C. Chen, A Design Methodology for Synthesizing Parallel Algorithms and Architectures,J. of Parallel and Distrib. Computing 3(6):461?491 (December 1986).","journal-title":"J. of Parallel and Distrib. Computing"},{"key":"CR24","doi-asserted-by":"crossref","unstructured":"D. D. Kandlur and K. G. Shin, Traffic Routing for Multi-computer Networks with Virtual Cut-through Capability,Proc. of the 10th Int'l Conf. on Distrib. Comput. Syst., pp. 398?405 (May 1990).","DOI":"10.1109\/ICDCS.1990.89308"},{"issue":"4","key":"CR25","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1109\/TC.1987.1676922","volume":"36","author":"B. P. Bianchini","year":"1987","unstructured":"B. P. Bianchini and J. P. Shen, Interprocessor Traffic Scheduling Algorithm for Multiprocessor Network,IEEE Trans. on Comput. C-36(4):396?409 (April 1987).","journal-title":"IEEE Trans. on Comput. C"},{"key":"CR26","first-page":"191","volume-title":"European Symposium on Programming","author":"Simon M. Kaplan","year":"1988","unstructured":"Simon M. Kaplan and Gail E. Kaiser, Garp: Graph Abstractions for Concurrent Programming, H. Ganzinger (ed.),European Symposium on Programming, Vol. 300 ofLecture Notes in Comput. Sci. Heidelberg, Springer-Verlag, pp. 191?205 (March 1988)."},{"key":"CR27","doi-asserted-by":"crossref","unstructured":"D. A. Bailey and J. E. Cuny, Graph Grammar Based Specification of Interconnection Structures for Massively Parallel Computation,Proc. of the Third Int'l Workshop on Graph Grammars, pp. 73?85 (1987).","DOI":"10.1007\/3-540-18771-5_46"},{"issue":"6","key":"CR28","doi-asserted-by":"crossref","first-page":"663","DOI":"10.1109\/32.24720","volume":"15","author":"J. Magee","year":"1989","unstructured":"J. Magee, J. Kramer, and M. Sloman, Constructing Distributed Systems in Conic,IEEE Trans. on Software Engineering SE15(6):663?675 (June 1989).","journal-title":"IEEE Trans. on Software Engineering SE"},{"key":"CR29","unstructured":"D. A. Bailey and J. E. Cuny,Visual Extensions to Parallel Programming Languages, MIT Press, pp. 17?36 (August 1989)."},{"key":"CR30","unstructured":"P. A. Nelson and L. Snyder, Programming Paradigms for Nonshared Memory Parallel Computers,The Characteristics of Parallel Algorithms, The MIT Press, pp. 3?20 (1987)."},{"key":"CR31","unstructured":"L. Snyder and D. Socha, Poker on the Cosmic Cube: the First Retargetable Parallel Programming Language and Environment,Proc. Int's Conf. on Parallel Proc., pp. 628?635 (August 1986)."},{"key":"CR32","unstructured":"L. Snyder,The XYZ Abstraction Levels of Poker-like Languages, MIT Press, pp. 470?489 (August 1989)."},{"key":"CR33","unstructured":"W. G. Griswold, G. A. Harrison, D. Notkin, and L. Snyder, Part Ensembles: A Communication Abstraction for Nonshared Memory Parallel Programming, Technical Report, Department of Computer Science, University of Washington (1989)."},{"issue":"4","key":"CR34","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1145\/359460.359478","volume":"21","author":"J. Vuillemin","year":"1987","unstructured":"J. Vuillemin, A Data Structure for Manipulating Priority Queues,Commun. of the ACM 21(4):309?315 (April 1987).","journal-title":"Commun. of the ACM"},{"key":"CR35","first-page":"128","volume":"III","author":"V. M. Lo","year":"1990","unstructured":"V. M. Lo, S. Rajopadhy, S. Gupta, D. Keldsen, M. A. Mohamed, and J. Telle, Mapping Divide-and-conquer Algorithms to Parallel Architectures,Proc. IEEE Int'l Conf. on Parallel Proc., Vol. III, pp. 128?135 (August 1990). (Also available as University of Oregon Technical Report CIS-TR-89-19.)","journal-title":"Proc. IEEE Int'l Conf. on Parallel Proc."},{"key":"CR36","unstructured":"X. X. Zhong, S. Rajopadhye, and V. M. Lo, Parallel Implementation of Divide-andconquer Algorithms on Biniary Debruijn Networks, Technical Report CIS-TR-91-21, University of Oregon (1991). (To appear inSixth Int'l Parallel Processing Symp.)"},{"key":"CR37","unstructured":"H. Wielandt,Finite Permutation Groups, Academic Press (1964)."},{"key":"CR38","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1090\/conm\/089\/13","volume":"89","author":"M. Fellows","year":"1989","unstructured":"M. Fellows, Problem Corner,Contemporary Mathematics 89: 187?188 (1989).","journal-title":"Contemporary Mathematics"},{"issue":"4","key":"CR39","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1109\/12.21148","volume":"38","author":"S. B. Akers","year":"1989","unstructured":"S. B. Akers and B. Krishnamurthy, A Group-theoretic Model for Symmetric Interconnection Network,IEEE Trans. on Comput. C-38(4):555?566 (April 1989).","journal-title":"IEEE Trans. on Comput. C"},{"key":"CR40","unstructured":"V. M. Lo, Algorithms for Static Assignment and Symmetric Contraction in Distributed Computing Systems,Proc. IEEE Int'l Conf. on Parallel Proc., pp. 239?244 (August 1988)."},{"key":"CR41","doi-asserted-by":"crossref","unstructured":"X. X. Zhong and V. M. Lo, Application Specific Deadlock Free Wormhole Routing on Multicomputers, Technical Report CIS-TR-92-03, University of Oregon (1992). To appear inPARLE 92.","DOI":"10.1007\/3-540-55599-4_89"},{"key":"CR42","unstructured":"X. X. Zhong and V. M. Lo, An Efficient Heuristic for Applications Specific Routing on Mesh Connected Multiprocessors, Technical Report CIS-TR-92-04, University of Oregon (1992). (To appear in 1992Int'l Conf. on Parallel Processing.)"},{"issue":"5","key":"CR43","first-page":"547","volume":"36","author":"C. L. Seitz","year":"1987","unstructured":"C. L. Seitz and W. J. Dally, Deadlock-free Message Routing in Multiprocessor Interconnection Networks,IEEE Trans. on Comput. 36(5):547?553 (May 1987).","journal-title":"IEEE Trans. on Comput."},{"key":"CR44","unstructured":"Y. Han and R. Finkel, An Optimal Scheme for Disseminating Information,Proc. of the Int'l Conf. on Parallel Proc., pp. 198?203 (August 1988)."},{"key":"CR45","first-page":"89","volume":"16","author":"R. H. Campbell","year":"1974","unstructured":"R. H. Campbell and A. N. Habermann,The Specification of Process Synchronization by Path Expressions, Springer-Verlag16:89?102 (1974).","journal-title":"The Specification of Process Synchronization by Path Expressions"},{"key":"CR46","unstructured":"S. L. Johnsson, Communication in Network Architectures.VLSI and Parallel Computation, Morgan Kaufmann Publishers, Inc., p. 290 (1990)."},{"key":"CR47","first-page":"88","volume":"II","author":"V. M. Lo","year":"1990","unstructured":"V. M. Lo, S. Rajopadhye, S. Gupta, D. Keldsen, M. A. Mohamed, and J. Telle, OREGAMI: Software Tools for Mapping Parallel Algorithms to Parallel Architectures,Proc. Int'l Conf. on Parallel Proc., Vol. II, pp. 88?92 (August 1990). Updated version available as University of Oregon Technical Report CIS-TR-89-18a.","journal-title":"Proc. Int'l Conf. on Parallel Proc."},{"key":"CR48","unstructured":"V. M. Lo, S. Rajopadhye, M. A. Mohamed, S. Gupta, B. Nitzberg, J. A. Telle, and X. X. Zhong, LaRCS: A Language for Describing Parallel Computations for the Purpose of Mapping, Technical Report CIS-TR-90-16. University of Oregon Department of Computer Science (1990). (To appear inIEEE Trans. on Parallel and Distrib. Syst.)"},{"key":"CR49","first-page":"347","volume":"I","author":"R. Rowley","year":"1990","unstructured":"R. Rowley and B. Bose, On Necklaces in Shuffle-exchange and DeBruijn Networks,Proc. Int'l Conf. on Parallel Proc., Vol. I, pp. 347?350 (August 1990).","journal-title":"Proc. Int'l Conf. on Parallel Proc."}],"container-title":["International Journal of Parallel Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01379319.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01379319\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01379319","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T16:19:37Z","timestamp":1586189977000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01379319"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,6]]},"references-count":49,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1991,6]]}},"alternative-id":["BF01379319"],"URL":"https:\/\/doi.org\/10.1007\/bf01379319","relation":{},"ISSN":["0885-7458","1573-7640"],"issn-type":[{"value":"0885-7458","type":"print"},{"value":"1573-7640","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,6]]}}}