扩展高速共享内存交换机结构缓冲区

2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552) Pub Date : 2001-05-29 DOI:10.1109/HPSR.2001.923647

M. Hegde, M. Naraghi-Pour

{"title":"扩展高速共享内存交换机结构缓冲区","authors":"M. Hegde, M. Naraghi-Pour","doi":"10.1109/HPSR.2001.923647","DOIUrl":null,"url":null,"abstract":"A novel approach is presented for expanding the buffer size in a shared memory switch. Utilizing this two-tier buffering mechanism we present a two-level scheduling algorithm whose complexity is considerably lower than that of purely input scheduling algorithms. Furthermore, this approach easily provides differentiated qualities of service to different traffic classes while maintaining high throughput across the switch fabric.","PeriodicalId":308964,"journal":{"name":"2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Scaling high-speed shared-memory switch fabric buffers\",\"authors\":\"M. Hegde, M. Naraghi-Pour\",\"doi\":\"10.1109/HPSR.2001.923647\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A novel approach is presented for expanding the buffer size in a shared memory switch. Utilizing this two-tier buffering mechanism we present a two-level scheduling algorithm whose complexity is considerably lower than that of purely input scheduling algorithms. Furthermore, this approach easily provides differentiated qualities of service to different traffic classes while maintaining high throughput across the switch fabric.\",\"PeriodicalId\":308964,\"journal\":{\"name\":\"2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)\",\"volume\":\"53 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-05-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HPSR.2001.923647\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HPSR.2001.923647","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

提出了一种扩展共享内存开关缓冲区大小的新方法。利用这种两层缓冲机制，我们提出了一种两级调度算法，其复杂度大大低于纯输入调度算法。此外，这种方法很容易为不同的流量类别提供差异化的服务质量，同时保持跨交换机结构的高吞吐量。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Scaling high-speed shared-memory switch fabric buffers

A novel approach is presented for expanding the buffer size in a shared memory switch. Utilizing this two-tier buffering mechanism we present a two-level scheduling algorithm whose complexity is considerably lower than that of purely input scheduling algorithms. Furthermore, this approach easily provides differentiated qualities of service to different traffic classes while maintaining high throughput across the switch fabric.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)

自引率

0.00%

发文量