LINEAR SYSTOLIC ROUND-ROBIN SCHEDULER AND SCHEDULING METHOD THEREOF

PURPOSE: A linear systolic Round-Robin scheduler and its scheduling method are provided to implement a simple circuit structure having an excellent modularity for many shared communication links and perform a 2-dimensional Round-Robin scheduling of a high throughput by scheduling at a high speed man...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: LEE, JEONG HUI, JUNG, GAP JUNG, HAN, MAN SU, LEE, BEOM CHEOL, CHOI, IK SEONG, PARK, GWON CHEOL
Format: Patent
Sprache:eng ; kor
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:PURPOSE: A linear systolic Round-Robin scheduler and its scheduling method are provided to implement a simple circuit structure having an excellent modularity for many shared communication links and perform a 2-dimensional Round-Robin scheduling of a high throughput by scheduling at a high speed many shared communication links with a small circuit size. CONSTITUTION: A Round Rover(310) outputs an output Round Robin seed address(o-seed) which is increased by 1 every Round-Robin scheduling cycle and an input Round-Robin seed address(i-seed) which is increased by 1 every Nth Round-Robin scheduling cycle. A request matrix register block(320) reads a request data of an input port to every output port by one time and propagates it to a rotation block(330). The rotation block(330) rotates the request signals read by line unit every Round-robin scheduling cycle from the request matrix register block(320) by using the output Round-Robin seed address. The rotated request signals are propagated to request propagation blocks(341,342,343). Processing elements(344,345,346) are respectively connected to each request propagation blocks(341,342,343) to form pairs. The request signals propagated from the rotation block(330) are propagated from the first request propagation block(341) to the nth request propagation block(343). In this respect, in each propagation block, the request signals are propagated in a pipeline as the uppermost bit is rotated by single bits to the lowermost bit. An aggregator block(350) is positioned at the end of the overall pipeline stage. The aggregator block(350) determines a use allowance of every input shafted communication link and output shared communication link selected by each pipeline stage and each Round-Robin cycles, and generates a data for configuring a space division switching.