The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Nous présentons une correspondance simple en pipeline, appelée PSM, pour un commutateur tampon d'entrée permettant d'assouplir la contrainte de synchronisation de planification en modifiant la correspondance de taille maximale en pipeline (PMM). À l'instar de la méthode pipeline de PMM, pour produire les résultats de correspondance dans chaque créneau horaire, PSM utilise plusieurs sous-planificateurs qui prennent plus d'un créneau horaire pour effectuer la correspondance. En utilisant uniquement les informations de tête de ligne des tampons d'entrée, PSM envoie successivement chaque requête à tous les sous-ordonnanceurs pour offrir une meilleure opportunité de correspondance. Pour obtenir de meilleures performances, PSM utilise des points de départ uniques de pointeurs de planification dans lesquels la différence entre les points de départ est égale pour deux sous-planificateurs adjacents pour une même sortie. En utilisant des simulations informatiques sous un trafic uniforme, nous montrons que le PSM est plus approprié que le PMM pour la planification pipeline d'un commutateur tamponné en entrée.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copier
Man-Soo HAN, Bongtae KIM, "Pipelined Simple Matching for Input Buffered Switches" in IEICE TRANSACTIONS on Communications,
vol. E85-B, no. 11, pp. 2539-2543, November 2002, doi: .
Abstract: We present pipelined simple matching, called PSM, for an input buffered switch to relax the scheduling timing constraint by modifying pipelined maximal-sized matching (PMM). Like the pipelined manner of PMM, to produce the matching results in every time slot, PSM employs multiple subschedulers which take more than one time slot to complete matching. Using only head-of-line information of input buffers, PSM successively sends each request to all subschedulers to provide a better matching opportunity. To obtain better performance, PSM uses unique starting points of scheduling pointers in which the difference between the starting points is equal for any two adjacent subschedulers for a same output. Using computer simulations under a uniform traffic, we show PSM is more appropriate than PMM for pipelined scheduling of an input buffered switch.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e85-b_11_2539/_p
Copier
@ARTICLE{e85-b_11_2539,
author={Man-Soo HAN, Bongtae KIM, },
journal={IEICE TRANSACTIONS on Communications},
title={Pipelined Simple Matching for Input Buffered Switches},
year={2002},
volume={E85-B},
number={11},
pages={2539-2543},
abstract={We present pipelined simple matching, called PSM, for an input buffered switch to relax the scheduling timing constraint by modifying pipelined maximal-sized matching (PMM). Like the pipelined manner of PMM, to produce the matching results in every time slot, PSM employs multiple subschedulers which take more than one time slot to complete matching. Using only head-of-line information of input buffers, PSM successively sends each request to all subschedulers to provide a better matching opportunity. To obtain better performance, PSM uses unique starting points of scheduling pointers in which the difference between the starting points is equal for any two adjacent subschedulers for a same output. Using computer simulations under a uniform traffic, we show PSM is more appropriate than PMM for pipelined scheduling of an input buffered switch.},
keywords={},
doi={},
ISSN={},
month={November},}
Copier
TY - JOUR
TI - Pipelined Simple Matching for Input Buffered Switches
T2 - IEICE TRANSACTIONS on Communications
SP - 2539
EP - 2543
AU - Man-Soo HAN
AU - Bongtae KIM
PY - 2002
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E85-B
IS - 11
JA - IEICE TRANSACTIONS on Communications
Y1 - November 2002
AB - We present pipelined simple matching, called PSM, for an input buffered switch to relax the scheduling timing constraint by modifying pipelined maximal-sized matching (PMM). Like the pipelined manner of PMM, to produce the matching results in every time slot, PSM employs multiple subschedulers which take more than one time slot to complete matching. Using only head-of-line information of input buffers, PSM successively sends each request to all subschedulers to provide a better matching opportunity. To obtain better performance, PSM uses unique starting points of scheduling pointers in which the difference between the starting points is equal for any two adjacent subschedulers for a same output. Using computer simulations under a uniform traffic, we show PSM is more appropriate than PMM for pipelined scheduling of an input buffered switch.
ER -