{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T21:34:31Z","timestamp":1757540071908},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1988,11,1]],"date-time":"1988-11-01T00:00:00Z","timestamp":594345600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[1988,11]]},"DOI":"10.1007\/bf00129784","type":"journal-article","created":{"date-parts":[[2004,10,31]],"date-time":"2004-10-31T10:15:24Z","timestamp":1099217724000},"page":"349-372","source":"Crossref","is-referenced-by-count":35,"title":["A programming aid for hypercube architectures"],"prefix":"10.1007","volume":"2","author":[{"given":"Min-You","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel D.","family":"Gajski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"12","key":"CR1","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1145\/361604.361619","volume":"17","author":"T. L. Adam","year":"1974","unstructured":"Adam, T. L., Chandy, K. M., and Dickson, J. R. 1974. A comparison of list scheduling for parallel processing systems. Comm. ACM, 17 (12): 685?690.","journal-title":"Comm. ACM"},{"key":"CR2","unstructured":"Allan, R., Baumgartner, D., Kennedy, K., and Porterfield, A. 1986. PTOOL: A semi-automatic parallel programming assistant. Proc. 1986 Internat. Conf. on Parallel Processing, pp. 164?170."},{"key":"CR3","unstructured":"Ametek Computer Research Division. 1986. Ametek System 14 User's Guide: C Edition. Arcadia, Calif."},{"key":"CR4","unstructured":"Appelbe, W. F., and McDowell, C. 1985. Anomaly detection in parallel Fortran programs. Proc. Workshop on Parallel Processing Using the HEP."},{"issue":"4","key":"CR5","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1109\/TC.1987.1676922","volume":"C-36","author":"R. P. Bianchini","year":"1987","unstructured":"Bianchini, R. P., and Shen, J. P. 1987. Interprocessor traffic scheduling algorithm for multiple-processor networks. IEEE Trans. Computers, C-36 (4): 396?409.","journal-title":"IEEE Trans. Computers"},{"key":"CR6","first-page":"286","volume-title":"Proc. IFIP Congress 74","author":"B. Bussell","year":"1974","unstructured":"Bussell, B., Fernandez, E., and Levy, O. 1974. Optimal scheduling for homogeneous multiprocessors. Proc. IFIP Congress 74, North-Holland, Amsterdam; American Elsevier, New York, pp. 286?290."},{"key":"CR7","unstructured":"Colley S., and Palmer, J. 1986. Architecture of a hypercube supercomputer. Proc. Internat. Conf. on Parallel Processing, pp.653?660."},{"key":"CR8","series-title":"Report No. UCB\/USD 83\/140","volume-title":"SIMON: A simulator of multicomputer networks","author":"R. MP. Fujimoto","year":"1983","unstructured":"Fujimoto, R. MP. 1983. SIMON: A simulator of multicomputer networks. Report No. UCB\/USD 83\/140, University of California, Berkeley."},{"issue":"6","key":"CR9","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1109\/MC.1985.1662920","volume":"18","author":"D. D. Gajski","year":"1985","unstructured":"Gajski, D. D., and Peir, J. K. 1985. The essential issues in multiprocessor systems. IEEE Computer, 18(6): 9?27.","journal-title":"IEEE Computer"},{"key":"CR10","unstructured":"Gustafson, H. L., Hawkinson, S., and Scott, K. 1986. The architecture of a homeogeneous vector supercomputer. Proc. Internat. Conf. on Parallel Processing, pp. 649?652."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1137\/1014035","volume":"14","author":"M. Hanan","year":"1972","unstructured":"Hanan, M., and Kurtzberg, J. M. 1972. A review of the placement and quadratic assignment problems. SIAM Rev., 14: 324?342.","journal-title":"SIAM Rev."},{"issue":"5","key":"CR12","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1109\/MM.1986.304707","volume":"6","author":"J. P. Hayes","year":"1986","unstructured":"Hayes, J. P., Mudge, T., Stout, Q. F., Colley, S., et al. 1986. A microprocessor-based hypercube supercomputer. IEEE Micro, 6(5): 6?17.","journal-title":"IEEE Micro"},{"key":"CR13","series-title":"Computer Science Technical Report CS-TR87-6","volume-title":"A performance characterization of the FPS T-series hypercube","author":"B. K. Helminen","year":"1987","unstructured":"Helminen, B. K., and Poplawski, D. A. 1987. A performance characterization of the FPS T-series hypercube. Computer Science Technical Report CS-TR87?6, Michigan Technological University, Houghton, Mich."},{"issue":"6","key":"CR14","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1287\/opre.9.6.841","volume":"9","author":"T. C. Hu","year":"1961","unstructured":"Hu, T. C. 1961. Parallel sequencing and assembly line problems. Operations Research, 9(6): 841?848.","journal-title":"Operations Research"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"1235","DOI":"10.1109\/T-C.1975.224171","volume":"C-24","author":"W. H. Kohler","year":"1975","unstructured":"Kohler, W. H. 1975. A preliminary evaluation of the critical path method for scheduling tasks on multiprocessor systems. IEEE Trans. Computers, C-24: 1235?1238.","journal-title":"IEEE Trans. Computers"},{"key":"CR16","doi-asserted-by":"crossref","unstructured":"Kruatrachue, B., and Lewis, T. 1988. Grain size determination for parallel processing. IEEE Software, Jan.: 23?32.","DOI":"10.1109\/52.1991"},{"issue":"3","key":"CR17","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1145\/356819.356822","volume":"12","author":"D. Landskov","year":"1980","unstructured":"Landskov, D., Davidson, S., Shriver, B., and Mallett, P. W. 1980. Local microcode compaction techniques. Computing Surveys, 12(3): 261?294.","journal-title":"Computing Surveys"},{"issue":"4","key":"CR18","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1109\/TC.1987.1676925","volume":"C-36","author":"S. Y. Lee","year":"1987","unstructured":"Lee, S. Y., and Aggarwal, J. K. 1987. A mapping strategy for parallel processing. IEEE Trans. Computers, C-36 (4): 433?442.","journal-title":"IEEE Trans. Computers"},{"issue":"9","key":"CR19","doi-asserted-by":"crossref","first-page":"763","DOI":"10.1109\/TC.1980.1675676","volume":"Vol. C-29","author":"D. A. Padua","year":"1980","unstructured":"Padua, D. A., Kuck, D. J., and Lawrie, D. L. 1980. High speed multiprocessor and compilation techniques. IEEE Trans. Computers, Vol. C-29(9): 763?776.","journal-title":"IEEE Trans. Computers"},{"key":"CR20","unstructured":"Peir, J. K., and Gajski, D. D. 1986. CAMP: A programming aide for multiprocessors. Proc. Internat. Conf. on Parallel Processing, pp. 475?482."},{"key":"CR21","unstructured":"Peir, J. K., Gajski, D. D., and Wu, M. Y. 1987. Programming environments for multiprocessors. Proceeding of International Seminar on Scientific Supercomputers, pp.47?68."},{"key":"CR22","unstructured":"Peterson, J. C., Tuazon, J. O., Lieberman, D., and Pniel, M. 1985. The Mark III Hypercube Ensemble Concurrent Computer. Proc. Internat. Conf. on Parallel Processing, pp. 71?73."},{"key":"CR23","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1109\/TC.1972.5008918","volume":"C-21","author":"C. V. Ramamoorthy","year":"1972","unstructured":"Ramamoorthy, C. V., Chandy, K. M., and Gonzales, M. J. 1972. Optimal scheduling strategies in a multiprocessor system. IEEE Trans. Computers, C-21: 137?146.","journal-title":"IEEE Trans. Computers"},{"key":"CR24","first-page":"157","volume":"vol. 54","author":"J. Rattner","year":"1985","unstructured":"Rattner, J. 1985. Concurrent processing: A new direction in scientific computing. Proc. National Computer Conf., vol. 54, pp. 157?166.","journal-title":"Proc. National Computer Conf."},{"key":"CR25","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1145\/2465.2467","volume":"28","author":"C. L. Seitz","year":"1985","unstructured":"Seitz, C. L. 1985. The COSMIC cube. Communications of the ACM, 28: 22?33.","journal-title":"Communications of the ACM"},{"key":"CR26","volume-title":"Computer and Job-Shop Scheduling Theory","author":"R. Sethi","year":"1976","unstructured":"Sethi, R. 1976. Algorithms for minimal-length schedules. In Computer and Job-Shop Scheduling Theory, Wiley, New York, Chapter 2."},{"key":"CR27","unstructured":"Tuazon, J., Peterson, J., Pniel, M., and Liberman, D. 1985. Caltech\/JPL Mark II Hypercube Concurrent Processor. Proc. Internat. Conf. on Parallel Processing, pp.666?673."},{"key":"CR28","unstructured":"Wu, M. Y., and Gajski, D. D. 1987. A programming aid for message-passing systems. Proc. Third SIAM Conf. on Parallel Processing for Scientific Computing."}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00129784.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00129784\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00129784","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,3]],"date-time":"2019-04-03T00:51:39Z","timestamp":1554252699000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00129784"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,11]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1988,11]]}},"alternative-id":["BF00129784"],"URL":"https:\/\/doi.org\/10.1007\/bf00129784","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988,11]]}}}