{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T05:13:48Z","timestamp":1734066828078,"version":"3.30.2"},"reference-count":27,"publisher":"Elsevier BV","issue":"11-12","license":[{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Systems Architecture"],"published-print":{"date-parts":[[2003,4]]},"DOI":"10.1016\/s1383-7621(03)00020-1","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T21:48:28Z","timestamp":1051134508000},"page":"325-336","source":"Crossref","is-referenced-by-count":2,"title":["On the topological properties of the arrangement\u2013star network"],"prefix":"10.1016","volume":"48","author":[{"given":"A.M.","family":"Awwad","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Al-Ayyoub","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Ould-Khaoua","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1383-7621(03)00020-1_BIB1","unstructured":"A. Menn, A.K. Somani, An efficient sorting algorithm for the star network interconnection network, Proceedings of the International Conference Parallel Processing, 1990, pp. 1\u20138"},{"issue":"4","key":"10.1016\/S1383-7621(03)00020-1_BIB2","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1109\/12.21148","article-title":"A group-networks theoretical model for symmetric interconnection networks","volume":"38","author":"Akers","year":"1998","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S1383-7621(03)00020-1_BIB3","unstructured":"S. Akers, D. Harel, B. Krishnamurthy, The star network: an attractive alternative to the n-cube, Proceedings of the International Conference on Parallel Processing, 1987, pp. 393\u2013400"},{"issue":"2","key":"10.1016\/S1383-7621(03)00020-1_BIB4","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1006\/jpdc.1997.1414","article-title":"The hyperstar interconnection network","volume":"48","author":"Al-Ayyoub","year":"1998","journal-title":"J. Parallel Distr. Comput."},{"issue":"8","key":"10.1016\/S1383-7621(03)00020-1_BIB5","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1109\/71.605767","article-title":"Matrix decomposition on the star network","volume":"8","author":"Al-Ayyoub","year":"1997","journal-title":"IEEE Trans. Parallel Distr. Syst."},{"key":"10.1016\/S1383-7621(03)00020-1_BIB6","doi-asserted-by":"crossref","unstructured":"A. Al-Ayyoub, K. Day, Node-ranking schemes for the star, in press, (2002)","DOI":"10.1016\/S0743-7315(02)00056-4"},{"issue":"12","key":"10.1016\/S1383-7621(03)00020-1_BIB7","doi-asserted-by":"crossref","first-page":"1292","DOI":"10.1109\/71.553290","article-title":"Optimal information dissemination in star and pancake networks","volume":"7","author":"Berthome","year":"1996","journal-title":"IEEE Trans. Parallel Distr. Syst."},{"key":"10.1016\/S1383-7621(03)00020-1_BIB8","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/S0020-0190(98)00052-0","article-title":"On the arrangement network","volume":"66","author":"Chiang","year":"1998","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S1383-7621(03)00020-1_BIB9","doi-asserted-by":"crossref","unstructured":"S. Das, A. Banerjee, Hyper Petersen network, yet another hypercube-like topology, Proceedings of the Frontiers \u201892 McLean, Virginia, 1992, pp. 270\u2013277","DOI":"10.1109\/FMPC.1992.234949"},{"key":"10.1016\/S1383-7621(03)00020-1_BIB10","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0020-0190(92)90030-Y","article-title":"Arrangement networks: a class of generalized star networks","volume":"42","author":"Day","year":"1992","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S1383-7621(03)00020-1_BIB11","first-page":"35","article-title":"Characterization of node-disjoint paths in arrangement networks","volume":"25","author":"Day","year":"1998","journal-title":"Kuwait J. Sci. Eng."},{"issue":"1","key":"10.1016\/S1383-7621(03)00020-1_BIB12","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1109\/71.262586","article-title":"A comparative study of topological properties of hypercubes and star networks","volume":"5","author":"Day","year":"1994","journal-title":"IEEE Trans. Parallel Distr. Syst."},{"issue":"2","key":"10.1016\/S1383-7621(03)00020-1_BIB13","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1109\/71.577251","article-title":"The cross product of interconnection networks","volume":"8","author":"Day","year":"1997","journal-title":"IEEE Trans. Parallel Distr. Syst."},{"key":"10.1016\/S1383-7621(03)00020-1_BIB14","article-title":"The network product of interconnection networks, A case study: merging the properties of the star network and the hypercube","volume":"6","author":"Day","year":"1996","journal-title":"J. Math. Model. Scientific Comput."},{"key":"10.1016\/S1383-7621(03)00020-1_BIB15","unstructured":"K. Day, A. Tripathi, Embedding of grids and hypercubes and characterization of spanning trees in arrangement network, Proceedings of the International Conference Parallel Processing, 1993, pp. 56\u201372"},{"key":"10.1016\/S1383-7621(03)00020-1_BIB16","unstructured":"K. Day, A. Tripathi, Embedding of cycles in arrangement networks, Tech. Report TR 91-58 Computer science Dept. Univ. of Minnesota, October, 1992"},{"key":"10.1016\/S1383-7621(03)00020-1_BIB17","doi-asserted-by":"crossref","unstructured":"K. Efe, A. Fernandez, Computational properties of mesh connected trees: versatile architecture for parallel computation, Proceedings of the International Conference on Parallel Processing, 1994, pp. 72\u201376","DOI":"10.1109\/ICPP.1994.73"},{"issue":"5","key":"10.1016\/S1383-7621(03)00020-1_BIB18","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1109\/71.282562","article-title":"A parallel algorithm for computing Fourier transforms on the star network","volume":"5","author":"Fragopoulou","year":"1994","journal-title":"IEEE Trans. Parallel Distr. Syst."},{"issue":"9","key":"10.1016\/S1383-7621(03)00020-1_BIB19","doi-asserted-by":"crossref","first-page":"962","DOI":"10.1109\/71.243525","article-title":"The Hyper-deBruijn networks: scalable versatile architecture","volume":"4","author":"Ganesan","year":"1993","journal-title":"IEEE Trans. Parallel Distr. Comput."},{"issue":"6","key":"10.1016\/S1383-7621(03)00020-1_BIB20","doi-asserted-by":"crossref","first-page":"756","DOI":"10.1109\/12.277296","article-title":"The cost of broadcasting on star networks and k-ary hypercubes","volume":"42","author":"Graham","year":"1993","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"10.1016\/S1383-7621(03)00020-1_BIB21","first-page":"407","article-title":"Embedding complete binary trees in star networks","volume":"21","author":"Jung","year":"1994","journal-title":"J. Korea Inform. Sci. Soc."},{"issue":"1","key":"10.1016\/S1383-7621(03)00020-1_BIB22","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1142\/S0218126691000215","article-title":"Embedding of cycles and grids in star networks","volume":"1","author":"Jwo","year":"1991","journal-title":"J. Circuits, Syst. Comput."},{"key":"10.1016\/S1383-7621(03)00020-1_BIB23","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1006\/jpdc.1996.1297","article-title":"Selection, routing, and sorting on the star network","volume":"41","author":"Rajasekaran","year":"1997","journal-title":"J. Parallel Distr. Comput."},{"key":"10.1016\/S1383-7621(03)00020-1_BIB24","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1016\/0166-218X(92)90152-Z","article-title":"Product-shuffle networks: towards reconciling shuffles and butterflies","volume":"37\/38","author":"Rosenberg","year":"1992","journal-title":"Discr. Appl. Math."},{"key":"10.1016\/S1383-7621(03)00020-1_BIB25","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1109\/71.494627","article-title":"Two ranking schemes for efficient computation on the star interconnection network","volume":"7","author":"Saika","year":"1996","journal-title":"IEEE Trans. Parallel Distr. Syst."},{"key":"10.1016\/S1383-7621(03)00020-1_BIB26","first-page":"1292","article-title":"Order preserving communication on a star network","volume":"21","author":"Saika","year":"1995","journal-title":"Parallel Comput."},{"key":"10.1016\/S1383-7621(03)00020-1_BIB27","doi-asserted-by":"crossref","unstructured":"A.Youssef, Design and analysis of product networks, Proceedings of the 5th Symposium Frontiers of Massively Parallel Computation (Frontiers \u201995), 1995, pp. 521\u2013528","DOI":"10.1109\/FMPC.1995.380472"}],"container-title":["Journal of Systems Architecture"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1383762103000201?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1383762103000201?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T05:29:20Z","timestamp":1733981360000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1383762103000201"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,4]]},"references-count":27,"journal-issue":{"issue":"11-12","published-print":{"date-parts":[[2003,4]]}},"alternative-id":["S1383762103000201"],"URL":"https:\/\/doi.org\/10.1016\/s1383-7621(03)00020-1","relation":{},"ISSN":["1383-7621"],"issn-type":[{"type":"print","value":"1383-7621"}],"subject":[],"published":{"date-parts":[[2003,4]]}}}