Optimal and Suboptimal Processor Allocation for Hypercycle-Based Multiprocesors
| dc.contributor.author | Dimakopoulos, V. V. | en |
| dc.contributor.author | Dimopoulos, N. J. | en |
| dc.date.accessioned | 2015-11-24T17:01:22Z | |
| dc.date.available | 2015-11-24T17:01:22Z | |
| dc.identifier.uri | https://olympias.lib.uoi.gr/jspui/handle/123456789/10912 | |
| dc.rights | Default Licence | - |
| dc.title | Optimal and Suboptimal Processor Allocation for Hypercycle-Based Multiprocesors | en |
| heal.abstract | Allocating nodes in a concurrent computer system depends on the topology of the system. In this work, we present a number of processor allocation strategies for Hypercycle based concurrent systems. Hypercycles is a class of multidimensional interconnection networks which includes such widely used networks as the binary n-cubes, k-ary n-cubes, generalized hypercubes etc. The allocation strategies presented include a statically optimal first-fit allocation, a suboptimal-first fit, and strategies with extended search space through the inclusion of additional search lists formed by permuting the base through which a hypercycle is defined. For all these strategies, we examine their optimality and present simulation results characterizing their performance relative to each other | en |
| heal.access | campus | - |
| heal.fullTextAvailability | TRUE | - |
| heal.identifier.primary | 10.1109/71.342130 | - |
| heal.journalName | IEEE Transactions on Parallel and Distributed Systems | en |
| heal.journalType | peer reviewed | - |
| heal.language | en | - |
| heal.publicationDate | 1995 | - |
| heal.recordProvider | Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικής | el |
| heal.type | journalArticle | - |
| heal.type.el | Άρθρο Περιοδικού | el |
| heal.type.en | Journal article | en |
Αρχεία
Φάκελος/Πακέτο αδειών
1 - 1 of 1
Φόρτωση...
- Ονομα:
- license.txt
- Μέγεθος:
- 1.74 KB
- Μορφότυπο:
- Item-specific license agreed upon to submission
- Περιγραφή: