{"title":"用于ATM交换网络的可伸缩硬件最早截止日期优先调度程序","authors":"B. Kim, K. Shin","doi":"10.1109/REAL.1997.641283","DOIUrl":null,"url":null,"abstract":"A fast, scalable hardware earliest deadline first (EDF) link scheduler for ATM switching network is developed. This EDF scheduler is a fast hardware solution suitable for real time scheduler on nodes in ATM switching networks up to 2.5 Gbps switching speed (scheduling within 0.17 /spl mu/s), capable of performing simultaneous input and output operations within two clock cycles (mostly in one clock cycle). The designed hardware is efficient since the architecture employs the minimum size EDF priority queue, combined with variable size FIFO queues for channels implemented with a two port memory buffer. Early traffic can be simply checked and delayed. Also, it is scalable with respect to the number of channels C and the total number of buffers N. Moreover, deadline folding technique eliminates the need to extend the deadline resolution. Simulation studies and layout design demonstrate the efficiency and utility of the proposed architecture.","PeriodicalId":231201,"journal":{"name":"Proceedings Real-Time Systems Symposium","volume":"344 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"27","resultStr":"{\"title\":\"Scalable hardware earliest-deadline-first scheduler for ATM switching networks\",\"authors\":\"B. Kim, K. Shin\",\"doi\":\"10.1109/REAL.1997.641283\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A fast, scalable hardware earliest deadline first (EDF) link scheduler for ATM switching network is developed. This EDF scheduler is a fast hardware solution suitable for real time scheduler on nodes in ATM switching networks up to 2.5 Gbps switching speed (scheduling within 0.17 /spl mu/s), capable of performing simultaneous input and output operations within two clock cycles (mostly in one clock cycle). The designed hardware is efficient since the architecture employs the minimum size EDF priority queue, combined with variable size FIFO queues for channels implemented with a two port memory buffer. Early traffic can be simply checked and delayed. Also, it is scalable with respect to the number of channels C and the total number of buffers N. Moreover, deadline folding technique eliminates the need to extend the deadline resolution. Simulation studies and layout design demonstrate the efficiency and utility of the proposed architecture.\",\"PeriodicalId\":231201,\"journal\":{\"name\":\"Proceedings Real-Time Systems Symposium\",\"volume\":\"344 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1997-12-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"27\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings Real-Time Systems Symposium\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/REAL.1997.641283\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings Real-Time Systems Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/REAL.1997.641283","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Scalable hardware earliest-deadline-first scheduler for ATM switching networks
A fast, scalable hardware earliest deadline first (EDF) link scheduler for ATM switching network is developed. This EDF scheduler is a fast hardware solution suitable for real time scheduler on nodes in ATM switching networks up to 2.5 Gbps switching speed (scheduling within 0.17 /spl mu/s), capable of performing simultaneous input and output operations within two clock cycles (mostly in one clock cycle). The designed hardware is efficient since the architecture employs the minimum size EDF priority queue, combined with variable size FIFO queues for channels implemented with a two port memory buffer. Early traffic can be simply checked and delayed. Also, it is scalable with respect to the number of channels C and the total number of buffers N. Moreover, deadline folding technique eliminates the need to extend the deadline resolution. Simulation studies and layout design demonstrate the efficiency and utility of the proposed architecture.