{"title":"基于cdma的片上网络自适应调度","authors":"Manho Kim, Daewook Kim, G. Sobelman","doi":"10.1109/NEWCAS.2005.1496682","DOIUrl":null,"url":null,"abstract":"A novel adaptive scheduling algorithm for CDMA-based networks-on-chip is proposed. An orthogonal variable spreading factor (OVSF) code is combined with the dual round robin matching (DRRM) algorithm to obtain efficient usage of orthogonal codewords. The length of codewords is adjusted depending on how many active IP blocks have packets to send at any given time. In addition, pointers are maintained to perform the necessary input and output arbitration. SystemC simulation results demonstrate that our scheduling technique exhibits the fairness property.","PeriodicalId":131387,"journal":{"name":"The 3rd International IEEE-NEWCAS Conference, 2005.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":"{\"title\":\"Adaptive scheduling for CDMA-based networks-on-chip\",\"authors\":\"Manho Kim, Daewook Kim, G. Sobelman\",\"doi\":\"10.1109/NEWCAS.2005.1496682\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A novel adaptive scheduling algorithm for CDMA-based networks-on-chip is proposed. An orthogonal variable spreading factor (OVSF) code is combined with the dual round robin matching (DRRM) algorithm to obtain efficient usage of orthogonal codewords. The length of codewords is adjusted depending on how many active IP blocks have packets to send at any given time. In addition, pointers are maintained to perform the necessary input and output arbitration. SystemC simulation results demonstrate that our scheduling technique exhibits the fairness property.\",\"PeriodicalId\":131387,\"journal\":{\"name\":\"The 3rd International IEEE-NEWCAS Conference, 2005.\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-06-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"13\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The 3rd International IEEE-NEWCAS Conference, 2005.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NEWCAS.2005.1496682\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The 3rd International IEEE-NEWCAS Conference, 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NEWCAS.2005.1496682","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Adaptive scheduling for CDMA-based networks-on-chip
A novel adaptive scheduling algorithm for CDMA-based networks-on-chip is proposed. An orthogonal variable spreading factor (OVSF) code is combined with the dual round robin matching (DRRM) algorithm to obtain efficient usage of orthogonal codewords. The length of codewords is adjusted depending on how many active IP blocks have packets to send at any given time. In addition, pointers are maintained to perform the necessary input and output arbitration. SystemC simulation results demonstrate that our scheduling technique exhibits the fairness property.