1 resultado para Parallel or distributed processing
em WestminsterResearch - UK
Filtro por publicador
- JISC Information Environment Repository (1)
- Aberdeen University (7)
- Aberystwyth University Repository - Reino Unido (2)
- Acceda, el repositorio institucional de la Universidad de Las Palmas de Gran Canaria. España (1)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (1)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (2)
- Aquatic Commons (1)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (1)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (6)
- Aston University Research Archive (15)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (3)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (3)
- Biblioteca Digital de Teses e Dissertações Eletrônicas da UERJ (6)
- Bioline International (1)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (11)
- Boston University Digital Common (216)
- Bucknell University Digital Commons - Pensilvania - USA (3)
- Bulgarian Digital Mathematics Library at IMI-BAS (4)
- CaltechTHESIS (1)
- Cambridge University Engineering Department Publications Database (15)
- CentAUR: Central Archive University of Reading - UK (74)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (14)
- Cochin University of Science & Technology (CUSAT), India (6)
- CORA - Cork Open Research Archive - University College Cork - Ireland (3)
- Dalarna University College Electronic Archive (1)
- Deakin Research Online - Australia (78)
- Department of Computer Science E-Repository - King's College London, Strand, London (2)
- Digital Commons - Michigan Tech (1)
- Digital Commons at Florida International University (5)
- Digital Peer Publishing (1)
- Digital Repository at Iowa State University (1)
- DigitalCommons@University of Nebraska - Lincoln (1)
- Diposit Digital de la UB - Universidade de Barcelona (1)
- DRUM (Digital Repository at the University of Maryland) (1)
- Duke University (3)
- eResearch Archive - Queensland Department of Agriculture; Fisheries and Forestry (2)
- FUNDAJ - Fundação Joaquim Nabuco (1)
- Greenwich Academic Literature Archive - UK (23)
- Helda - Digital Repository of University of Helsinki (3)
- Indian Institute of Science - Bangalore - Índia (34)
- Instituto Politécnico do Porto, Portugal (12)
- Massachusetts Institute of Technology (9)
- Ministerio de Cultura, Spain (1)
- National Center for Biotechnology Information - NCBI (8)
- Publishing Network for Geoscientific & Environmental Data (6)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (79)
- Queensland University of Technology - ePrints Archive (183)
- Repositório Científico do Instituto Politécnico de Lisboa - Portugal (1)
- Repositório Institucional da Universidade de Aveiro - Portugal (3)
- Repositório Institucional da Universidade de Brasília (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (39)
- SAPIENTIA - Universidade do Algarve - Portugal (2)
- Savoirs UdeS : plateforme de diffusion de la production intellectuelle de l’Université de Sherbrooke - Canada (1)
- Universidad de Alicante (5)
- Universidad del Rosario, Colombia (2)
- Universidad Politécnica de Madrid (32)
- Universidade Federal do Rio Grande do Norte (UFRN) (4)
- Universitat de Girona, Spain (2)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (4)
- Université de Montréal (2)
- Université de Montréal, Canada (5)
- University of Michigan (1)
- University of Queensland eSpace - Australia (8)
- University of Washington (1)
- WestminsterResearch - UK (1)
Relevância:
Resumo:
Recently honeycomb meshes have been considered as alternative candidates for interconnection networks in parallel and distributed computer systems. This paper presents a solution to one of the open problems about honeycomb meshes—the so-called three disjoint path problem. The problem requires minimizing the length of the longest of any three disjoint paths between 3-degree nodes. This solution provides information on the re-routing of traffic along the network in the presence of faults.