Mutual priority

A scheme for effective and efficient distributed schedulers for high-speed cell-based switches

C. Xithalis, M. Gamvrili, D. N. Serpanos

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

Distributed scheduling algorithms for cell-based Virtual Output Queuing (VOQ) switches have led to high-performance schedulers. However, existing algorithms suffer from low service guarantees and a need for several iterations to provide high throughput. In this paper, we introduce the mutual priority concept, a new mechanism that addresses these issues. We prove that mutual priority algorithms achieve optimal service guarantee (N in an N × N switch) and lead to packet delays that outperform all existing algorithms with significant improvements: the delay achieved by the most efficient mutual priority algorithm is 4.5 times lower for high loads (i.e., reduced by 78%) than the delay achieved by the best existing scheduler for a single iteration execution, while for log N iterations the improved delay is 2.5 times lower (i.e., reduced by 60%). Importantly, mutual priority schedulers provide significantly high performance with a single iteration, outperforming all alternatives and achieving performance comparable to that with multiple Iterations.

Original languageEnglish
Title of host publication2005 Workshop on High Performance Switching and Routing, HPSR 2005
Pages63-67
Number of pages5
Publication statusPublished - 15 Nov 2005
Externally publishedYes
Event2005 Workshop on High Performance Switching and Routing, HPSR 2005 - Hong Kong, China
Duration: 12 May 200514 May 2005

Other

Other2005 Workshop on High Performance Switching and Routing, HPSR 2005
CountryChina
CityHong Kong
Period12/5/0514/5/05

Fingerprint

Switches
Scheduling algorithms
Parallel algorithms
Throughput

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Xithalis, C., Gamvrili, M., & Serpanos, D. N. (2005). Mutual priority: A scheme for effective and efficient distributed schedulers for high-speed cell-based switches. In 2005 Workshop on High Performance Switching and Routing, HPSR 2005 (pp. 63-67)

Mutual priority : A scheme for effective and efficient distributed schedulers for high-speed cell-based switches. / Xithalis, C.; Gamvrili, M.; Serpanos, D. N.

2005 Workshop on High Performance Switching and Routing, HPSR 2005. 2005. p. 63-67.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Xithalis, C, Gamvrili, M & Serpanos, DN 2005, Mutual priority: A scheme for effective and efficient distributed schedulers for high-speed cell-based switches. in 2005 Workshop on High Performance Switching and Routing, HPSR 2005. pp. 63-67, 2005 Workshop on High Performance Switching and Routing, HPSR 2005, Hong Kong, China, 12/5/05.
Xithalis C, Gamvrili M, Serpanos DN. Mutual priority: A scheme for effective and efficient distributed schedulers for high-speed cell-based switches. In 2005 Workshop on High Performance Switching and Routing, HPSR 2005. 2005. p. 63-67
Xithalis, C. ; Gamvrili, M. ; Serpanos, D. N. / Mutual priority : A scheme for effective and efficient distributed schedulers for high-speed cell-based switches. 2005 Workshop on High Performance Switching and Routing, HPSR 2005. 2005. pp. 63-67
@inproceedings{07787b50dc5d4db38c110be6e06e0c09,
title = "Mutual priority: A scheme for effective and efficient distributed schedulers for high-speed cell-based switches",
abstract = "Distributed scheduling algorithms for cell-based Virtual Output Queuing (VOQ) switches have led to high-performance schedulers. However, existing algorithms suffer from low service guarantees and a need for several iterations to provide high throughput. In this paper, we introduce the mutual priority concept, a new mechanism that addresses these issues. We prove that mutual priority algorithms achieve optimal service guarantee (N in an N × N switch) and lead to packet delays that outperform all existing algorithms with significant improvements: the delay achieved by the most efficient mutual priority algorithm is 4.5 times lower for high loads (i.e., reduced by 78{\%}) than the delay achieved by the best existing scheduler for a single iteration execution, while for log N iterations the improved delay is 2.5 times lower (i.e., reduced by 60{\%}). Importantly, mutual priority schedulers provide significantly high performance with a single iteration, outperforming all alternatives and achieving performance comparable to that with multiple Iterations.",
author = "C. Xithalis and M. Gamvrili and Serpanos, {D. N.}",
year = "2005",
month = "11",
day = "15",
language = "English",
isbn = "0780389247",
pages = "63--67",
booktitle = "2005 Workshop on High Performance Switching and Routing, HPSR 2005",

}

TY - GEN

T1 - Mutual priority

T2 - A scheme for effective and efficient distributed schedulers for high-speed cell-based switches

AU - Xithalis, C.

AU - Gamvrili, M.

AU - Serpanos, D. N.

PY - 2005/11/15

Y1 - 2005/11/15

N2 - Distributed scheduling algorithms for cell-based Virtual Output Queuing (VOQ) switches have led to high-performance schedulers. However, existing algorithms suffer from low service guarantees and a need for several iterations to provide high throughput. In this paper, we introduce the mutual priority concept, a new mechanism that addresses these issues. We prove that mutual priority algorithms achieve optimal service guarantee (N in an N × N switch) and lead to packet delays that outperform all existing algorithms with significant improvements: the delay achieved by the most efficient mutual priority algorithm is 4.5 times lower for high loads (i.e., reduced by 78%) than the delay achieved by the best existing scheduler for a single iteration execution, while for log N iterations the improved delay is 2.5 times lower (i.e., reduced by 60%). Importantly, mutual priority schedulers provide significantly high performance with a single iteration, outperforming all alternatives and achieving performance comparable to that with multiple Iterations.

AB - Distributed scheduling algorithms for cell-based Virtual Output Queuing (VOQ) switches have led to high-performance schedulers. However, existing algorithms suffer from low service guarantees and a need for several iterations to provide high throughput. In this paper, we introduce the mutual priority concept, a new mechanism that addresses these issues. We prove that mutual priority algorithms achieve optimal service guarantee (N in an N × N switch) and lead to packet delays that outperform all existing algorithms with significant improvements: the delay achieved by the most efficient mutual priority algorithm is 4.5 times lower for high loads (i.e., reduced by 78%) than the delay achieved by the best existing scheduler for a single iteration execution, while for log N iterations the improved delay is 2.5 times lower (i.e., reduced by 60%). Importantly, mutual priority schedulers provide significantly high performance with a single iteration, outperforming all alternatives and achieving performance comparable to that with multiple Iterations.

UR - http://www.scopus.com/inward/record.url?scp=27644482136&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=27644482136&partnerID=8YFLogxK

M3 - Conference contribution

SN - 0780389247

SP - 63

EP - 67

BT - 2005 Workshop on High Performance Switching and Routing, HPSR 2005

ER -