PMM: A pipelined maximal-sized matching scheduling approach for input-buffered switches

Eiji Oki, Roberto Rojas-Cessa, H. Jonathan Chao

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

Abstract

This paper proposes an innovative Pipeline-based Maximal-sized Matching scheduling approach, called PMM, for input-buffered switches. It dramatically relaxes the timing constraint for arbitration with a maximal matching scheme. In the PMM approach, arbitration operates in a pipelined manner, where K subschedulers are used. Each subscheduler is allowed to take more than one time slot for its matching. Every time slot, one of them provides the matching result. The subscheduler can adopt a pre-existing efficient maximal matching algorithm such as iSLIP and DRRM. PMM maximizes the efficiency of the adopted arbitration scheme by allowing sufficient time for a number of iterations. We show that PMM preserves 100% throughput under uniform traffic and fairness for best-effort traffic of the pre-existing algorithm.

Original languageEnglish (US)
Title of host publicationConference Record / IEEE Global Telecommunications Conference
Pages35-39
Number of pages5
Volume1
StatePublished - 2001
EventIEEE Global Telecommunicatins Conference GLOBECOM'01 - San Antonio, TX, United States
Duration: Nov 25 2001Nov 29 2001

Other

OtherIEEE Global Telecommunicatins Conference GLOBECOM'01
CountryUnited States
CitySan Antonio, TX
Period11/25/0111/29/01

Fingerprint

Scheduling
Switches
Pipelines
Throughput
traffic
preserve

Keywords

  • Input-buffered switch
  • Maximal-sized matching
  • Pipeline
  • Scheduling

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Global and Planetary Change

Cite this

Oki, E., Rojas-Cessa, R., & Chao, H. J. (2001). PMM: A pipelined maximal-sized matching scheduling approach for input-buffered switches. In Conference Record / IEEE Global Telecommunications Conference (Vol. 1, pp. 35-39)

PMM : A pipelined maximal-sized matching scheduling approach for input-buffered switches. / Oki, Eiji; Rojas-Cessa, Roberto; Chao, H. Jonathan.

Conference Record / IEEE Global Telecommunications Conference. Vol. 1 2001. p. 35-39.

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

Oki, E, Rojas-Cessa, R & Chao, HJ 2001, PMM: A pipelined maximal-sized matching scheduling approach for input-buffered switches. in Conference Record / IEEE Global Telecommunications Conference. vol. 1, pp. 35-39, IEEE Global Telecommunicatins Conference GLOBECOM'01, San Antonio, TX, United States, 11/25/01.
Oki E, Rojas-Cessa R, Chao HJ. PMM: A pipelined maximal-sized matching scheduling approach for input-buffered switches. In Conference Record / IEEE Global Telecommunications Conference. Vol. 1. 2001. p. 35-39
Oki, Eiji ; Rojas-Cessa, Roberto ; Chao, H. Jonathan. / PMM : A pipelined maximal-sized matching scheduling approach for input-buffered switches. Conference Record / IEEE Global Telecommunications Conference. Vol. 1 2001. pp. 35-39
@inproceedings{661c7d01e863431a824273d05369327c,
title = "PMM: A pipelined maximal-sized matching scheduling approach for input-buffered switches",
abstract = "This paper proposes an innovative Pipeline-based Maximal-sized Matching scheduling approach, called PMM, for input-buffered switches. It dramatically relaxes the timing constraint for arbitration with a maximal matching scheme. In the PMM approach, arbitration operates in a pipelined manner, where K subschedulers are used. Each subscheduler is allowed to take more than one time slot for its matching. Every time slot, one of them provides the matching result. The subscheduler can adopt a pre-existing efficient maximal matching algorithm such as iSLIP and DRRM. PMM maximizes the efficiency of the adopted arbitration scheme by allowing sufficient time for a number of iterations. We show that PMM preserves 100{\%} throughput under uniform traffic and fairness for best-effort traffic of the pre-existing algorithm.",
keywords = "Input-buffered switch, Maximal-sized matching, Pipeline, Scheduling",
author = "Eiji Oki and Roberto Rojas-Cessa and Chao, {H. Jonathan}",
year = "2001",
language = "English (US)",
volume = "1",
pages = "35--39",
booktitle = "Conference Record / IEEE Global Telecommunications Conference",

}

TY - GEN

T1 - PMM

T2 - A pipelined maximal-sized matching scheduling approach for input-buffered switches

AU - Oki, Eiji

AU - Rojas-Cessa, Roberto

AU - Chao, H. Jonathan

PY - 2001

Y1 - 2001

N2 - This paper proposes an innovative Pipeline-based Maximal-sized Matching scheduling approach, called PMM, for input-buffered switches. It dramatically relaxes the timing constraint for arbitration with a maximal matching scheme. In the PMM approach, arbitration operates in a pipelined manner, where K subschedulers are used. Each subscheduler is allowed to take more than one time slot for its matching. Every time slot, one of them provides the matching result. The subscheduler can adopt a pre-existing efficient maximal matching algorithm such as iSLIP and DRRM. PMM maximizes the efficiency of the adopted arbitration scheme by allowing sufficient time for a number of iterations. We show that PMM preserves 100% throughput under uniform traffic and fairness for best-effort traffic of the pre-existing algorithm.

AB - This paper proposes an innovative Pipeline-based Maximal-sized Matching scheduling approach, called PMM, for input-buffered switches. It dramatically relaxes the timing constraint for arbitration with a maximal matching scheme. In the PMM approach, arbitration operates in a pipelined manner, where K subschedulers are used. Each subscheduler is allowed to take more than one time slot for its matching. Every time slot, one of them provides the matching result. The subscheduler can adopt a pre-existing efficient maximal matching algorithm such as iSLIP and DRRM. PMM maximizes the efficiency of the adopted arbitration scheme by allowing sufficient time for a number of iterations. We show that PMM preserves 100% throughput under uniform traffic and fairness for best-effort traffic of the pre-existing algorithm.

KW - Input-buffered switch

KW - Maximal-sized matching

KW - Pipeline

KW - Scheduling

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

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

M3 - Conference contribution

VL - 1

SP - 35

EP - 39

BT - Conference Record / IEEE Global Telecommunications Conference

ER -