Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Alfred J. Boals"'
Publikováno v:
The Journal of Supercomputing. 8:263-294
The hypercube, though a popular and versatile architecture, has a major drawback in that its size must be a power of two. In order to alleviate this drawback, Katseff [1988] defined theincomplete hypercube, which allows a hypercube-like architecture
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::179e13159d0eaf127649354a56f8fb4f
https://doi.org/10.1007/bf01204731
https://doi.org/10.1007/bf01204731
Publikováno v:
The Sixth Distributed Memory Computing Conference, 1991. Proceedings.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a8616e341846f794c8f4c2df5931bffe
https://doi.org/10.1109/dmcc.1991.633091
https://doi.org/10.1109/dmcc.1991.633091
Publikováno v:
IPPS
The authors show the embeddings of various types of n-node incomplete binary trees into n-node or (n+1)-node composite hypercubes with dilation of at most 2. They also present lower bound proofs showing optimality of the dilation. They characterize t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e526dc878530efa6de8491300aff0f4c
https://doi.org/10.1109/ipps.1991.153813
https://doi.org/10.1109/ipps.1991.153813
Publikováno v:
Scopus-Elsevier
The authors investigate load balancing properties of various existing networks using the concept of load balancing graphs. In particular, they present load balancing properties for butterfly, three-dimensional mesh, pyramid, and cube connected cycle
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::36122ad7b1566f5f93345d07f9fc396b
https://doi.org/10.1109/mwscas.1990.140720
https://doi.org/10.1109/mwscas.1990.140720
Publikováno v:
Advances in Computing and Information — ICCI '91 ISBN: 9783540540298
ICCI
ICCI
Given a set of m tasks, where each task has an execution time and a subcube requirement, the Hypercube Scheduling Problem (HSP) is to find an assignment of tasks which minimizes the total completion time. The general HSP is known to be NP-hard. In th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d44e32554ca3e0de18391204555364c3
https://doi.org/10.1007/3-540-54029-6_197
https://doi.org/10.1007/3-540-54029-6_197
Publikováno v:
Advances in Computing and Information — ICCI '91 ISBN: 9783540540298
ICCI
ICCI
The binary hypercube, although a versatile multiprocessor network, has a draw back: its size must be a power of two. In order to alleviate this draw back, we define the concept of an n-node Compact Hypercube CH(n) which deals with the problem of comp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1db2a3a68eeb5be8dec05a7c52bd9c5f
https://doi.org/10.1007/3-540-54029-6_187
https://doi.org/10.1007/3-540-54029-6_187
Autor:
Kenneth Williams, Alfred J. Boals
Publikováno v:
Mathematical and Computer Modelling. 11:914-919
One paradigm for optimizing the efficiency of solutions to instances of a difficult problem is to factor the problem into subcases and to optimize the solution for each subcase. Although an optimal solution for the general problem may not be found by
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::50364878dea992f29c96d06383fbaeac
https://doi.org/10.1016/0895-7177(88)90627-9
https://doi.org/10.1016/0895-7177(88)90627-9