{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T22:23:27Z","timestamp":1757629407947,"version":"3.44.0"},"reference-count":23,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1990,5,1]],"date-time":"1990-05-01T00:00:00Z","timestamp":641520000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1990,5,1]],"date-time":"1990-05-01T00:00:00Z","timestamp":641520000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Parallel and Distributed Computing"],"published-print":{"date-parts":[[1990,5]]},"DOI":"10.1016\/0743-7315(90)90110-b","type":"journal-article","created":{"date-parts":[[2004,2,23]],"date-time":"2004-02-23T15:14:09Z","timestamp":1077549249000},"page":"42-54","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":32,"title":["Mapping pyramid algorithms into hypercubes"],"prefix":"10.1016","volume":"9","author":[{"given":"Ten-Hwang","family":"Lai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"William","family":"White","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0743-7315(90)90110-B_BIB1","series-title":"Proc. 27th Annu. IEEE Symp. Foundations Comp. Sci.","first-page":"283","article-title":"How robust is the n-cube?","author":"Becker","year":"1986"},{"issue":"5","key":"10.1016\/0743-7315(90)90110-B_BIB2","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1016\/0743-7315(87)90018-9","article-title":"On mapping parallel algorithms into parallel architectures","volume":"4","author":"Berman","year":"1987","journal-title":"J. Parallel Distrib. Comput."},{"key":"10.1016\/0743-7315(90)90110-B_BIB3","article-title":"How to embed trees in hypercubes","author":"Bhatt","year":"1985","journal-title":"Yale University Res. Rep. RR-443"},{"key":"10.1016\/0743-7315(90)90110-B_BIB4","series-title":"Proc. 27th Annu. Symp. Foundations Comp. Sci.","first-page":"274","article-title":"Optimal simulations of tree machines","author":"Bhatt","year":"1986"},{"issue":"11","key":"10.1016\/0743-7315(90)90110-B_BIB5","doi-asserted-by":"crossref","first-page":"969","DOI":"10.1109\/TC.1986.1676698","article-title":"Multigrid algorithms on the hypercube multiprocessor","volume":"C-35","author":"Chan","year":"1986","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(90)90110-B_BIB6","series-title":"Proc. 1987 Internat. Conf. on Parallel Processing","first-page":"780","article-title":"Two-dimensional convolution on a pyramid computer","author":"Chang","year":"1987"},{"key":"10.1016\/0743-7315(90)90110-B_BIB7","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0020-0190(87)90090-1","article-title":"Fixed hypercube embedding","volume":"25","author":"Cybenko","year":"1987","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0743-7315(90)90110-B_BIB8","series-title":"Proc. 1986 Internal. Conf. on Parallel Processing","first-page":"661","article-title":"Scalability of a binary tree on a hypercube","author":"Deshpande","year":"1986"},{"key":"10.1016\/0743-7315(90)90110-B_BIB9","series-title":"Proc. 19th Annu. ACM Symp. Theory of Computing","first-page":"274","article-title":"Reconfiguring a hypercube in the presence of faults","author":"Hastad","year":"1987"},{"key":"10.1016\/0743-7315(90)90110-B_BIB10","series-title":"Proc. 1986 Internal. Conf. on Parallel Processing","first-page":"640","article-title":"Distributed routing algorithms for broadcasting and personalized communication in hypercubes","author":"Ho","year":"1986"},{"key":"10.1016\/0743-7315(90)90110-B_BIB11","series-title":"Proc. 1987 Internal. Conf. on Parallel Processing","first-page":"188","article-title":"On the embedding of arbitrary meshes in Boolean cubes with expansion two dilation two","author":"Ho","year":"1987"},{"key":"10.1016\/0743-7315(90)90110-B_BIB12","article-title":"Embedding hyper-pyramids into hypercubes","author":"Ho","year":"1988","journal-title":"Yale University Tech. Rep. TR-667"},{"issue":"4","key":"10.1016\/0743-7315(90)90110-B_BIB13","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1145\/2157.322401","article-title":"Cost trade-offs in graph embeddings, with applications","volume":"30","author":"Hong","year":"1983","journal-title":"J. ACM"},{"key":"10.1016\/0743-7315(90)90110-B_BIB14","article-title":"Mapping multiple pyramids into hypercubes using unit expansion","author":"Lai","year":"1988","journal-title":"Ohio State University Tech. Res. Rep. OSU-CISRC-10\/88-TR30"},{"key":"10.1016\/0743-7315(90)90110-B_BIB15","series-title":"Proc. 1987 Internal. Conf. on Parallel Processing","first-page":"178","article-title":"Embeddings among toruses and meshes","author":"Ma","year":"1987"},{"issue":"1","key":"10.1016\/0743-7315(90)90110-B_BIB16","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1137\/0216004","article-title":"Data movement techniques for the pyramid computer","volume":"16","author":"Miller","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0743-7315(90)90110-B_BIB17","series-title":"Proc. Third Conf. on Hypercube Computers and Applications","article-title":"The iPSC\/2 direct-connect communications technology","author":"Nugent","year":"1988"},{"key":"10.1016\/0743-7315(90)90110-B_BIB18","article-title":"Data communication in hypercubes","author":"Saad","year":"1985","journal-title":"Yale University Res. Rep. RR-428"},{"key":"10.1016\/0743-7315(90)90110-B_BIB19","article-title":"Topological properties of hypercubes","author":"Saad","year":"1985","journal-title":"Yale University Res. Rep. RR-3389"},{"issue":"1","key":"10.1016\/0743-7315(90)90110-B_BIB20","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1145\/2465.2467","article-title":"The cosmic cube","volume":"28","author":"Seitz","year":"1985","journal-title":"Comm. ACM"},{"key":"10.1016\/0743-7315(90)90110-B_BIB21","series-title":"Pyramidal Systems for Computer Vision","first-page":"75","article-title":"Hypercubes and pyramids","author":"Stout","year":"1986"},{"key":"10.1016\/0743-7315(90)90110-B_BIB22","series-title":"Proc. 1983 Internal. Conf. on Parallel Processing","first-page":"214","article-title":"Sorting, merging, selecting, and filtering on tree and pyramid machines","author":"Stout","year":"1983"},{"issue":"3","key":"10.1016\/0743-7315(90)90110-B_BIB23","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1016\/0743-7315(85)90026-7","article-title":"Embedding of tree networks into hypercubes","volume":"2","author":"Wu","year":"1985","journal-title":"J. Parallel Distrib. Comput."}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074373159090110B?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074373159090110B?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T14:30:34Z","timestamp":1757514634000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/074373159090110B"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,5]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,5]]}},"alternative-id":["074373159090110B"],"URL":"https:\/\/doi.org\/10.1016\/0743-7315(90)90110-b","relation":{},"ISSN":["0743-7315"],"issn-type":[{"type":"print","value":"0743-7315"}],"subject":[],"published":{"date-parts":[[1990,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Mapping pyramid algorithms into hypercubes","name":"articletitle","label":"Article Title"},{"value":"Journal of Parallel and Distributed Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0743-7315(90)90110-B","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1990 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}