| Autor: |
Gavrilova, Marina, Gervasi, Osvaldo, Kumar, Vipin, Tan, C. J. Kenneth, Taniar, David, Laganà, Antonio, Mun, Youngsong, Choo, Hyunseung, Liu, Chia-Lung, Moh, Chiou, Wu, Chin-Chi, Lin, Woei |
| Zdroj: |
Computational Science & Its Applications - ICCSA 2006 (9783540340720); 2006, p1111-1120, 10p |
| Abstrakt: |
This study analyzes how parallel packet switching (PPS) performs with a sliding window (SW). The PPS involves numerous packet switches that operate independently and in parallel. The typical PPS dispatch algorithm applies a round-robin method (RR). The class of PPS is characterized by deploying parallel center-stage switches that enable all memory buffers run more slowly than the external line rate. A novel SW packet switching method for PPS, called SW-PPS, is developed. The SW-PPS operates in a pipeline fashion to ensure overall switching. The performance of the RR-PPS and SW-PPS is evaluated for a torus topology. Under identical Bernoulli, the SW-PPS provided considerably outperformed RR-PPS. Furthermore, this investigation proposes a mathematical analytical model for RR-PPS and SW-PPS. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Supplemental Index |
| Externí odkaz: |
|
