Routing problem in rectangular mesh network using shortest path based Greedy method
A supercomputer can have thousands of processor-memory pairs which often referred as processing pins. Each of these pins is connected to each other through networks and passes message using a standard message passing mechanism such as Message Passing Interface. In this research, we consider the rout...
محفوظ في:
| المؤلفون الرئيسيون: | , , , |
|---|---|
| التنسيق: | Conference or Workshop Item |
| اللغة: | English |
| منشور في: |
IOP Publishing
2019
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | http://umpir.ump.edu.my/id/eprint/27917/1/Routing%20problem%20in%20rectangular%20mesh%20network%20using%20shortest.pdf http://umpir.ump.edu.my/id/eprint/27917/ https://doi.org/10.1088/1742-6596/1358/1/012079 |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|