#TITLE_ALTERNATIVE#
Hypercube (Qn) is a graph that used in parallel computing. Hypercube graph that contains faulty nodes/links is called injured hypercube. Hypercube graph without faulty component called healthy hypercube. In parallel computing, every node has adequate information to make correct routing decisions, bu...
Saved in:
| Main Author: | |
|---|---|
| Format: | Final Project |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/10351 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |
| id |
id-itb.:10351 |
|---|---|
| spelling |
id-itb.:103512017-09-27T11:43:04Z#TITLE_ALTERNATIVE# NOVANTO (NIM 10103041), ERDI Indonesia Final Project INSTITUT TEKNOLOGI BANDUNG https://digilib.itb.ac.id/gdl/view/10351 Hypercube (Qn) is a graph that used in parallel computing. Hypercube graph that contains faulty nodes/links is called injured hypercube. Hypercube graph without faulty component called healthy hypercube. In parallel computing, every node has adequate information to make correct routing decisions, but it does not have information about the whole hypercube. The reason is because it is very costly to enable every node having all information. Because of that, we need a routing mechanism that does not need a lot of information. A1 algorithm is an algorithm that can route message in a hypercube if the number of faulty components is less than n. This algorithm can only routes one message at a time, with some modification and the use of temporally and permanently injured components, this algorithm can carry out multiple routing. text |
| institution |
Institut Teknologi Bandung |
| building |
Institut Teknologi Bandung Library |
| continent |
Asia |
| country |
Indonesia Indonesia |
| content_provider |
Institut Teknologi Bandung |
| collection |
Digital ITB |
| language |
Indonesia |
| description |
Hypercube (Qn) is a graph that used in parallel computing. Hypercube graph that contains faulty nodes/links is called injured hypercube. Hypercube graph without faulty component called healthy hypercube. In parallel computing, every node has adequate information to make correct routing decisions, but it does not have information about the whole hypercube. The reason is because it is very costly to enable every node having all information. Because of that, we need a routing mechanism that does not need a lot of information. A1 algorithm is an algorithm that can route message in a hypercube if the number of faulty components is less than n. This algorithm can only routes one message at a time, with some modification and the use of temporally and permanently injured components, this algorithm can carry out multiple routing. |
| format |
Final Project |
| author |
NOVANTO (NIM 10103041), ERDI |
| spellingShingle |
NOVANTO (NIM 10103041), ERDI #TITLE_ALTERNATIVE# |
| author_facet |
NOVANTO (NIM 10103041), ERDI |
| author_sort |
NOVANTO (NIM 10103041), ERDI |
| title |
#TITLE_ALTERNATIVE# |
| title_short |
#TITLE_ALTERNATIVE# |
| title_full |
#TITLE_ALTERNATIVE# |
| title_fullStr |
#TITLE_ALTERNATIVE# |
| title_full_unstemmed |
#TITLE_ALTERNATIVE# |
| title_sort |
#title_alternative# |
| url |
https://digilib.itb.ac.id/gdl/view/10351 |
| _version_ |
1820664950052356096 |