Please use this identifier to cite or link to this item: https://olympias.lib.uoi.gr/jspui/handle/123456789/10912
Full metadata record
DC FieldValueLanguage
dc.contributor.authorDimakopoulos, V. V.en
dc.contributor.authorDimopoulos, N. J.en
dc.date.accessioned2015-11-24T17:01:22Z-
dc.date.available2015-11-24T17:01:22Z-
dc.identifier.urihttps://olympias.lib.uoi.gr/jspui/handle/123456789/10912-
dc.rightsDefault Licence-
dc.titleOptimal and Suboptimal Processor Allocation for Hypercycle-Based Multiprocesorsen
heal.typejournalArticle-
heal.type.enJournal articleen
heal.type.elΆρθρο Περιοδικούel
heal.identifier.primary10.1109/71.342130-
heal.languageen-
heal.accesscampus-
heal.recordProviderΠανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικήςel
heal.publicationDate1995-
heal.abstractAllocating 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 otheren
heal.journalNameIEEE Transactions on Parallel and Distributed Systemsen
heal.journalTypepeer reviewed-
heal.fullTextAvailabilityTRUE-
Appears in Collections:Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά)



This item is licensed under a Creative Commons License Creative Commons