Please use this identifier to cite or link to this item: https://olympias.lib.uoi.gr/jspui/handle/123456789/11147
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKontogiannis, S. C.en
dc.contributor.authorSpirakis, P. G.en
dc.contributor.authorPantziou, G. E.en
dc.contributor.authorYung, M.en
dc.date.accessioned2015-11-24T17:03:15Z-
dc.date.available2015-11-24T17:03:15Z-
dc.identifier.issn1432-4350-
dc.identifier.urihttps://olympias.lib.uoi.gr/jspui/handle/123456789/11147-
dc.rightsDefault Licence-
dc.titleRobust Parallel Computations through Randomizationen
heal.typejournalArticle-
heal.type.enJournal articleen
heal.type.elΆρθρο Περιοδικούel
heal.identifier.primary10.1007/s002240010009-
heal.accesscampus-
heal.recordProviderΠανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικήςel
heal.publicationDate2000-
heal.abstractIn this paper we present an efficient general simulation strategy for computations designed for fully operational BSP machines of n ideal processors, on n-processor dynamic-fault-prone BSP machines. The fault occurrences are failstop and fully dynamic, i.e., they are allowed to happen on-line at any point of the computation, subject to the constraint that the total number of faulty processors may never exceed a known fraction. The computational paradigm can be exploited for robust computations over virtual parallel settings with a volatile underlying infrastructure, such as a NETWORK OF WORKSTATIONS (where workstations may be taken out of the virtual parallel machine by their owner).en
heal.journalNameTheory of Computing Systemsen
heal.journalTypepeer reviewed-
heal.fullTextAvailabilityTRUE-
Appears in Collections:Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά)

Files in This Item:
File Description SizeFormat 
Kontogiannis-2000-Robust Parallel Computations through Randomization.pdf441.37 kBAdobe PDFView/Open    Request a copy


This item is licensed under a Creative Commons License Creative Commons