Pub Date : 1997-12-10DOI: 10.1109/ICAPP.1997.651491
C. B. Czech
Techniques of customizing and extending operating systems (OSs) have a growing impact on system architectures in the field of distributed computing and parallel programming. Even if traditional methods of adaption have been limited to the user-level, modern OSs cannot do without kernel support. Hence concepts and structures of microkernel architectures must be redefined to meet the requirements of today's and future applications. We propose a new customizable low-level OS architecture-the Dycos kernel. We discuss customization demands on microkernels and describe the basic kernel concept. Dycos is an object-based approach providing a toolbox of operations to build user-definable compositions of kernel structures. The Dycos approach has been evaluated on a Solaris 2.5.1 platform.
{"title":"Dycos-a customizable kernel architecture supporting distributed operating environments","authors":"C. B. Czech","doi":"10.1109/ICAPP.1997.651491","DOIUrl":"https://doi.org/10.1109/ICAPP.1997.651491","url":null,"abstract":"Techniques of customizing and extending operating systems (OSs) have a growing impact on system architectures in the field of distributed computing and parallel programming. Even if traditional methods of adaption have been limited to the user-level, modern OSs cannot do without kernel support. Hence concepts and structures of microkernel architectures must be redefined to meet the requirements of today's and future applications. We propose a new customizable low-level OS architecture-the Dycos kernel. We discuss customization demands on microkernels and describe the basic kernel concept. Dycos is an object-based approach providing a toolbox of operations to build user-definable compositions of kernel structures. The Dycos approach has been evaluated on a Solaris 2.5.1 platform.","PeriodicalId":325978,"journal":{"name":"Proceedings of 3rd International Conference on Algorithms and Architectures for Parallel Processing","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127137039","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1997-12-10DOI: 10.1109/ICAPP.1997.651480
A. Symons, V. Lakshmi Narasimhan
The emergence of large scale distributed memory computers has brought with it a variety of interconnection networks. As it is not feasible to fully interconnect the processors with a diameter of one, routing of messages is necessary. Wormhole routing is an efficient method of routing and in this paper, we derive a model for wormhole routing. Using this model, we determine the optimal buffer size, and hence show that for medium to large messages, the communication time using wormhole routing is dependent on the square root of the network diameter.
{"title":"Calculating optimal flit size and upper limit on the performance of wormhole routing","authors":"A. Symons, V. Lakshmi Narasimhan","doi":"10.1109/ICAPP.1997.651480","DOIUrl":"https://doi.org/10.1109/ICAPP.1997.651480","url":null,"abstract":"The emergence of large scale distributed memory computers has brought with it a variety of interconnection networks. As it is not feasible to fully interconnect the processors with a diameter of one, routing of messages is necessary. Wormhole routing is an efficient method of routing and in this paper, we derive a model for wormhole routing. Using this model, we determine the optimal buffer size, and hence show that for medium to large messages, the communication time using wormhole routing is dependent on the square root of the network diameter.","PeriodicalId":325978,"journal":{"name":"Proceedings of 3rd International Conference on Algorithms and Architectures for Parallel Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121700521","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：