{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,13]],"date-time":"2024-02-13T06:51:25Z","timestamp":1707807085211},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1995,6,1]],"date-time":"1995-06-01T00:00:00Z","timestamp":801964800000},"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":[[1995,6]]},"DOI":"10.1007\/bf02577868","type":"journal-article","created":{"date-parts":[[2007,3,22]],"date-time":"2007-03-22T23:36:35Z","timestamp":1174606595000},"page":"245-262","source":"Crossref","is-referenced-by-count":5,"title":["Minimizing redundant dependencies and interprocessor synchronizations"],"prefix":"10.1007","volume":"23","author":[{"given":"Heng-Yi","family":"Chao","sequence":"first","affiliation":[]},{"given":"Mary P.","family":"Harper","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02577868_CR1","doi-asserted-by":"crossref","first-page":"967","DOI":"10.1126\/science.231.4741.967","volume":"231","author":"D. Kuck","year":"1986","unstructured":"D. Kuck, E. Davidson, D. Lawrie, and A. Sameh, Parallel Supercomputing Today and the Cedar Approach,Science 231:967\u2013974 (1986).","journal-title":"Science"},{"issue":"32","key":"BF02577868_CR2","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1109\/TC.1983.1676201","volume":"C","author":"A. Gottlieb","year":"1983","unstructured":"A. Gottlieb, R. Grishman, C. P. Kruskal, K. P. McAuliffe, L. Rudolph, and M. Snir, The NYU Ultracomputer\u2014Designing an MIMD Shared-memory and Parallel Machine,IEEE Trans. on Computers C-32:175\u2013189 (1983).","journal-title":"IEEE Trans. on Computers"},{"issue":"3","key":"BF02577868_CR3","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1093\/comjnl\/33.3.219","volume":"33","author":"C. C. Price","year":"1990","unstructured":"C. C. Price and M. A. Salama, Scheduling of Precedence-Constrained Tasks on Multiprocessors,The Computer Journal 33(3):219\u2013229 (1990).","journal-title":"The Computer Journal"},{"key":"BF02577868_CR4","unstructured":"E. Arnould, F. Bitz, E. Cooper, H. T. Kung, R. D. Sansom, and P. Steenkiste, The Design of Nectar: A Network Backplane for Heterogeneous Multicomputers,Proc. of the Third Int'l Conf. on Architectural Support for Progr. Languages and Oper. Syst., pp. 205\u2013216 (1988)."},{"key":"BF02577868_CR5","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1109\/2.73","volume":"46","author":"W. C. Athas","year":"1988","unstructured":"W. C. Athas and C. L. Sietz, Multicomputers: Message-passing Concurrent Computers,IEEE Computer Magazine 46:9\u201324 (1988).","journal-title":"IEEE Computer Magazine"},{"issue":"4","key":"BF02577868_CR6","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1093\/comjnl\/33.4.330","volume":"33","author":"F. W. Burton","year":"1990","unstructured":"F. W. Burton, G. P. McKeown, and V. J. Rayward-Smith, Applications of UET Scheduling Theory to the Implementation of Declarative Languages,The Computer Journal 33(4):330\u2013336 (1990).","journal-title":"The Computer Journal"},{"issue":"11","key":"BF02577868_CR7","doi-asserted-by":"crossref","first-page":"1023","DOI":"10.1109\/TC.1984.1676376","volume":"33","author":"H. Kasahara","year":"1984","unstructured":"H. Kasahara and S. Narita, Practical Multiprocessor Scheduling Algorithms for Efficient Parallel Processing,IEEE Trans. on Computers C-33(11):1023\u20131029 (1984).","journal-title":"IEEE Trans. on Computers C"},{"key":"BF02577868_CR8","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1145\/109625.109632","volume":"26","author":"V. P. Krothapalli","year":"1991","unstructured":"V. P. Krothapalli and P. Sadayappan, Removal of Redundant Dependences in DOACROSS Loops with Constant DependencesProc. of the Third SIGPLAN Symp. on Principles and Practice of Parallel Programming 26:51\u201360 (1991).","journal-title":"Proc. of the Third SIGPLAN Symp. on Principles and Practice of Parallel Programming"},{"issue":"1","key":"BF02577868_CR9","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1109\/TC.1987.5009454","volume":"36","author":"Z. Li","year":"1987","unstructured":"Z. Li and W. Abu-Sufah, On Reducing Data Synchronization in Multiprocessed Loops,IEEE Trans. on Computers C-36(1):105\u2013109 (1987).","journal-title":"IEEE Trans. on Computers C"},{"issue":"5","key":"BF02577868_CR10","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1109\/TC.1986.1676781","volume":"35","author":"J. Blazewicz","year":"1986","unstructured":"J. Blazewicz, M. Drabowski, and J. Weglarz, Scheduling Multiprocessor Tasks to Minimize Schedule Length,IEEE Trans. on Computers C-35(5):389\u2013393 (1986).","journal-title":"IEEE Trans. on Computers C"},{"key":"BF02577868_CR11","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1007\/BF00288685","volume":"1","author":"E. G. Coffman","year":"1972","unstructured":"E. G. Coffman and R. L. Graham, Optimal Scheduling for Two-Processor Systems,Acta. Informatica 1:200\u2013213 (1972).","journal-title":"Acta. Informatica"},{"issue":"3","key":"BF02577868_CR12","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1145\/322326.322335","volume":"29","author":"H. N. Gabow","year":"1982","unstructured":"H. N. Gabow, An Almost-Linear Algorithm for Two-Processor Scheduling,Journal of the ACM 29(3):207\u2013227 (1982).","journal-title":"Journal of the ACM"},{"key":"BF02577868_CR13","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1287\/opre.9.6.841","volume":"9","author":"T. C. Hu","year":"1961","unstructured":"T. C. Hu, Parallel Sequencing and Assembly Line Problems,Operations Research 9:841\u2013848 (1961).","journal-title":"Operations Research"},{"issue":"11","key":"BF02577868_CR14","first-page":"1101","volume":"26","author":"H. F. Li","year":"1977","unstructured":"H. F. Li, Scheduling Trees in Parallel\/Pipelined Processing Environments,IEEE Trans. on Computers C-26(11):1101\u20131112 (1977).","journal-title":"IEEE Trans. on Computers C"},{"issue":"6","key":"BF02577868_CR15","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/0167-6377(89)90022-9","volume":"8","author":"V. F. Magirou","year":"1989","unstructured":"V. F. Magirou and J. Z. Milis, An Algorithm for the Multiprocessor Assignment Problems,Oper. Res. Lett. 8(6):351\u2013356 (1989).","journal-title":"Oper. Res. Lett."},{"issue":"12","key":"BF02577868_CR16","doi-asserted-by":"crossref","first-page":"1485","DOI":"10.1109\/TC.1987.5009499","volume":"36","author":"S. P. Midkiff","year":"1987","unstructured":"S. P. Midkiff and D. A. Padua, Compiler Algorithms for Synchronizations,IEEE Trans. on Computers C-36(12):1485\u20131495 (1987).","journal-title":"IEEE Trans. on Computers C"},{"key":"BF02577868_CR17","first-page":"138","volume":"3","author":"P. L. Shaffer","year":"1989","unstructured":"P. L. Shaffer, Minimization of Interprocessor Synchronization in Multiprocessors with Shared and Private Memory,Int'l Conf. on Parallel Processing 3:138\u2013142 (1989).","journal-title":"Int'l Conf. on Parallel Processing"},{"key":"BF02577868_CR18","unstructured":"D. Bernstein, An Improved Approximation Algorithm for Scheduling Pipelined Machines,Int'l Conf. on Parallel Processing, pp. 430\u2013433 (1988)."},{"key":"BF02577868_CR19","unstructured":"T.R. Gross, Code Optimization Techniques for Pipelined Architectures,COMPCON \u203283, Spring, pp, 278\u2013285 (1983)."},{"key":"BF02577868_CR20","unstructured":"H. Y. Chao and M. P. Harper, Scheduling a Superscalar Pipelined Processor Without Hardware Interlocks, Technical Report TR-EE 94-29, Purdue University (1994)."},{"issue":"5","key":"BF02577868_CR21","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1016\/0167-8191(92)90085-L","volume":"18","author":"Y. H. Shiau","year":"1992","unstructured":"Y. H. Shiau and C. P. Chung, Adoptability and Effectiveness of Microcode Compaction Algorithms in Superscalar Processing,Parallel Computing 18(5):497\u2013510 (1992).","journal-title":"Parallel Computing"},{"key":"BF02577868_CR22","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1109\/TCAD.1982.1269993","volume":"1","author":"T. Yoshimura","year":"1982","unstructured":"T. Yoshimura and E. S. Kuh, Efficient Algorithms for Channel Routing,IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems CAD-1:25\u201335 (1982).","journal-title":"IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems CAD"},{"key":"BF02577868_CR23","volume-title":"The Design and Analysis of Computer Algorithms","author":"A. V. Aho","year":"1976","unstructured":"A. V. Aho, J. E. Hopcroft and J. D. Ullman,The Design and Analysis of Computer Algorithms, Addison-Wesley Publishing Company, San Francisco, California (1976)."},{"key":"BF02577868_CR24","volume-title":"Computer Algorithms","author":"S. Baase","year":"1988","unstructured":"S. Baase,Computer Algorithms, Addison-Wesley Publishing Company, San Diego, California (1988)."},{"key":"BF02577868_CR25","volume-title":"Introduction to Algorithms","author":"T. H. Cormen","year":"1990","unstructured":"T. H. Cormen, C. E. Leiserson, and R. L. Rivest,Introduction to Algorithms, McGraw-Hill Book Company, New York (1990)."},{"key":"BF02577868_CR26","volume-title":"Computers and Intractability","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson,Computers and Intractability, W. H. Freeman and Company, San Francisco, California (1979)."},{"key":"BF02577868_CR27","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0167-6423(89)90039-7","volume":"12","author":"D. Gries","year":"1989","unstructured":"D. Gries, A. J. Martin, Jan L. A. van de Snepscheut, and J. T. Udding, An Algorithm for Transitive Reduction of an Acyclic Graph,Science of Computer Programming 12:151\u2013155 (1989).","journal-title":"Science of Computer Programming"},{"key":"BF02577868_CR28","volume-title":"Combinatorial Optimization: Algorithms and Complexity","author":"C. H. Papadimitriou","year":"1979","unstructured":"C. H. Papadimitriou and K. Steiglitz,Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall Inc., San Francisco, California (1979)."},{"key":"BF02577868_CR29","first-page":"11","volume":"4","author":"K. K. Lee","year":"1991","unstructured":"K. K. Lee and H. W. Leong, An Improved Lower Bound for Channel Routing Problems,IEEE Int'l Symp. on Circuits and Systems 4: 11\u201314 (1991).","journal-title":"IEEE Int'l Symp. on Circuits and Systems"},{"issue":"7","key":"BF02577868_CR30","doi-asserted-by":"crossref","first-page":"957","DOI":"10.1109\/12.55698","volume":"39","author":"J. S. Wang","year":"1990","unstructured":"J. S. Wang and R. C. T. Lee, An Efficient Channel Routing Algorithm to Yield an Optimal Solution,IEEE Trans. on Computers 39(7):957\u2013962 (1990).","journal-title":"IEEE Trans. on Computers"},{"issue":"12","key":"BF02577868_CR31","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1145\/361604.361619","volume":"17","author":"T. L. Adam","year":"1974","unstructured":"T. L. Adam, K. M. Chandy, and J. R. Dickson, A Comparison of List Schedules for Parallel Processing Systems,Comm. ACM 17(12):685\u2013690 (1974).","journal-title":"Comm. ACM"}],"container-title":["International Journal of Parallel Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02577868.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02577868\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02577868","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,12]],"date-time":"2024-02-12T09:27:57Z","timestamp":1707730077000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02577868"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,6]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1995,6]]}},"alternative-id":["BF02577868"],"URL":"https:\/\/doi.org\/10.1007\/bf02577868","relation":{},"ISSN":["0885-7458","1573-7640"],"issn-type":[{"value":"0885-7458","type":"print"},{"value":"1573-7640","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,6]]}}}