Pub Date : 1994-01-31DOI: 10.1109/MASCOT.1994.284447
Yuguang Wu
Trace-driven simulation of cache memories usually requires enormous disk space to store CPU trace data. On-the-fly simulation avoids this problem by running the simulation while the trace data is being generated. For write-back least-recently-used (LRU) caches, we propose an on-the-fly simulation method, which is a variant of the standard one-pass stack evaluation techniques that evaluates write ratios for multiple block-sizes in a one-pass processing of trace data. It is known that for LRU cache memories, the hit ratios can be found for multiple block-sizes in one-pass trace processing; and for write-back caches, the write ratios can be found for a single block size in one-pass trace processing. Combining these two techniques, this paper proposes a simple one-pass method for write-back LRU caches that evaluates write ratios for multiple block-sizes.<>
{"title":"Evaluation of write-back caches for multiple block-sizes","authors":"Yuguang Wu","doi":"10.1109/MASCOT.1994.284447","DOIUrl":"https://doi.org/10.1109/MASCOT.1994.284447","url":null,"abstract":"Trace-driven simulation of cache memories usually requires enormous disk space to store CPU trace data. On-the-fly simulation avoids this problem by running the simulation while the trace data is being generated. For write-back least-recently-used (LRU) caches, we propose an on-the-fly simulation method, which is a variant of the standard one-pass stack evaluation techniques that evaluates write ratios for multiple block-sizes in a one-pass processing of trace data. It is known that for LRU cache memories, the hit ratios can be found for multiple block-sizes in one-pass trace processing; and for write-back caches, the write ratios can be found for a single block size in one-pass trace processing. Combining these two techniques, this paper proposes a simple one-pass method for write-back LRU caches that evaluates write ratios for multiple block-sizes.<<ETX>>","PeriodicalId":288344,"journal":{"name":"Proceedings of International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116118615","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 : 1994-01-31DOI: 10.1109/MASCOT.1994.284442
I. Matta, A. Shankar
Future computer networks are expected to provide different types of service. For this purpose, new algorithms and protocols have been proposed for gateway scheduling, flow control, and routing. The interaction between these three components is crucial to the performance of the network. Existing work has studied only the interaction between scheduling and flow control, assuming static routing. We investigate the interaction between scheduling and adaptive routing. We view the network as a dynamical system. We apply the Liapunov direct method to derive stability conditions for the routes of different traffic classes. We show how with scheduling support for routing, the routes of the traffic classes can be isolated, thereby improving the overall network performance.<>
{"title":"On the interaction between gateway scheduling and routing","authors":"I. Matta, A. Shankar","doi":"10.1109/MASCOT.1994.284442","DOIUrl":"https://doi.org/10.1109/MASCOT.1994.284442","url":null,"abstract":"Future computer networks are expected to provide different types of service. For this purpose, new algorithms and protocols have been proposed for gateway scheduling, flow control, and routing. The interaction between these three components is crucial to the performance of the network. Existing work has studied only the interaction between scheduling and flow control, assuming static routing. We investigate the interaction between scheduling and adaptive routing. We view the network as a dynamical system. We apply the Liapunov direct method to derive stability conditions for the routes of different traffic classes. We show how with scheduling support for routing, the routes of the traffic classes can be isolated, thereby improving the overall network performance.<<ETX>>","PeriodicalId":288344,"journal":{"name":"Proceedings of International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems","volume":"178 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122156470","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 : 1994-01-31DOI: 10.1109/MASCOT.1994.284430
B. Haverkort, A. Moorsel, D. Speelman
Over the last two decades a considerable amount of effort has been put in the development and application of matrix geometric techniques for the analysis of queueing systems of which the (embedded) Markov chain exhibits a regular structure. Most of this work however has been presented in either a mathematical context or an a purely application-oriented context. In this paper we present XMGM, a performance analysis tool which allows its users to easily specify queueing systems in terms of interarrival and service time distributions. XMGM then takes care of the translation of this description to an underlying Markov chain that exhibits a matrix geometric solution. Subsequently, it takes care of the derivation of the measures specified by the user. With XMGM models are specified via C procedure calls. This turns out to be a very flexible approach for modelling queueing systems; it also allows for the easy evaluation of models over parameter ranges.<>
{"title":"XMGM: performance modeling using matrix geometric techniques","authors":"B. Haverkort, A. Moorsel, D. Speelman","doi":"10.1109/MASCOT.1994.284430","DOIUrl":"https://doi.org/10.1109/MASCOT.1994.284430","url":null,"abstract":"Over the last two decades a considerable amount of effort has been put in the development and application of matrix geometric techniques for the analysis of queueing systems of which the (embedded) Markov chain exhibits a regular structure. Most of this work however has been presented in either a mathematical context or an a purely application-oriented context. In this paper we present XMGM, a performance analysis tool which allows its users to easily specify queueing systems in terms of interarrival and service time distributions. XMGM then takes care of the translation of this description to an underlying Markov chain that exhibits a matrix geometric solution. Subsequently, it takes care of the derivation of the measures specified by the user. With XMGM models are specified via C procedure calls. This turns out to be a very flexible approach for modelling queueing systems; it also allows for the easy evaluation of models over parameter ranges.<<ETX>>","PeriodicalId":288344,"journal":{"name":"Proceedings of International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128486794","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 : 1994-01-31DOI: 10.1109/MASCOT.1994.284431
C. André, Marie-Agnès Peraldi-Frati
This paper deals with the simulation of the temporal behaviour of "real time systems". First, we characterize a class of applications: "interrupt-driven systems with complex pre-emption mechanisms" and we explain why classical analysis and simulation methods are not sufficient. Then, we introduce a new approach to realistic and efficient simulations of the temporal behaviour of interrupt-driven systems. This approach combines an object-orientated general purpose language (C++) and an imperative synchronous language (Esterel).<>
{"title":"Simulation of temporal behaviour based on a synchronous language","authors":"C. André, Marie-Agnès Peraldi-Frati","doi":"10.1109/MASCOT.1994.284431","DOIUrl":"https://doi.org/10.1109/MASCOT.1994.284431","url":null,"abstract":"This paper deals with the simulation of the temporal behaviour of \"real time systems\". First, we characterize a class of applications: \"interrupt-driven systems with complex pre-emption mechanisms\" and we explain why classical analysis and simulation methods are not sufficient. Then, we introduce a new approach to realistic and efficient simulations of the temporal behaviour of interrupt-driven systems. This approach combines an object-orientated general purpose language (C++) and an imperative synchronous language (Esterel).<<ETX>>","PeriodicalId":288344,"journal":{"name":"Proceedings of International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129327175","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 : 1994-01-31DOI: 10.1109/MASCOT.1994.284450
J. Wieselthier, C. M. Barnhart, A. Ephremides
The evaluation of data-packet delay in integrated networks is a difficult problem because the quantity of network resources available for data traffic is time varying and dependent on the voice traffic. We demonstrate that an extremely simple model for data-packet delay, although inaccurate in terms of delay measurements, can provide a remarkably accurate ranking among a number of different control policies. We also address the issues associated with the development of accurate delay models, and develop a simplified model for voice traffic in wireless networks that provides a highly accurate characterization of the time-varying resources used by voice, and hence available for data.<>
{"title":"Modeling, performance evaluation, and ordinal optimization of integrated voice/data networks","authors":"J. Wieselthier, C. M. Barnhart, A. Ephremides","doi":"10.1109/MASCOT.1994.284450","DOIUrl":"https://doi.org/10.1109/MASCOT.1994.284450","url":null,"abstract":"The evaluation of data-packet delay in integrated networks is a difficult problem because the quantity of network resources available for data traffic is time varying and dependent on the voice traffic. We demonstrate that an extremely simple model for data-packet delay, although inaccurate in terms of delay measurements, can provide a remarkably accurate ranking among a number of different control policies. We also address the issues associated with the development of accurate delay models, and develop a simplified model for voice traffic in wireless networks that provides a highly accurate characterization of the time-varying resources used by voice, and hence available for data.<<ETX>>","PeriodicalId":288344,"journal":{"name":"Proceedings of International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124752836","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 : 1994-01-31DOI: 10.1109/MASCOT.1994.284435
Yashovardhan R. Potlapalli, D. Agrawal
In most applications, some permutations are used more frequently than others. Therefore, it is necessary to determine the efficiency with which various MINs realize the set of frequently used permutations. It is known that the problem of determining the exact number of passes to realize a permutation is NP-complete. We present an efficient algorithm to determine the upper bound on the number of passes by first finding an O(NlogN) algorithm for conflict detection.<>
{"title":"Conflict analysis of multistage interconnection networks","authors":"Yashovardhan R. Potlapalli, D. Agrawal","doi":"10.1109/MASCOT.1994.284435","DOIUrl":"https://doi.org/10.1109/MASCOT.1994.284435","url":null,"abstract":"In most applications, some permutations are used more frequently than others. Therefore, it is necessary to determine the efficiency with which various MINs realize the set of frequently used permutations. It is known that the problem of determining the exact number of passes to realize a permutation is NP-complete. We present an efficient algorithm to determine the upper bound on the number of passes by first finding an O(NlogN) algorithm for conflict detection.<<ETX>>","PeriodicalId":288344,"journal":{"name":"Proceedings of International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124759279","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 : 1994-01-31DOI: 10.1109/MASCOT.1994.284409
M. Walch, A. Wolisz, J. Wolf-Günther
There is an increasing interest in developing performance enhanced extensions of standardised FDTs. We present how simulation and visualization of performance-extended formal specifications can be efficiently supported by the use of a high-level simulation environment. Requirements for selection of a proper environment are formulated and the design principles for a software package, built on top of this environment are presented. The developed software supports both editing and animated stepwise execution of the specifications using peculiar concepts like: actions, processes, operators etc. In addition the execution of simulation with a collection of statistical data and deadlock detection, as well as graphical presentation of results are supported.<>
{"title":"Visualization and performance analysis of formally specified communication protocols","authors":"M. Walch, A. Wolisz, J. Wolf-Günther","doi":"10.1109/MASCOT.1994.284409","DOIUrl":"https://doi.org/10.1109/MASCOT.1994.284409","url":null,"abstract":"There is an increasing interest in developing performance enhanced extensions of standardised FDTs. We present how simulation and visualization of performance-extended formal specifications can be efficiently supported by the use of a high-level simulation environment. Requirements for selection of a proper environment are formulated and the design principles for a software package, built on top of this environment are presented. The developed software supports both editing and animated stepwise execution of the specifications using peculiar concepts like: actions, processes, operators etc. In addition the execution of simulation with a collection of statistical data and deadlock detection, as well as graphical presentation of results are supported.<<ETX>>","PeriodicalId":288344,"journal":{"name":"Proceedings of International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126840588","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 : 1994-01-31DOI: 10.1109/MASCOT.1994.284427
M. Sayeed, Mohammed Atiquzzaman
Performance evaluation of multiple-bus multiprocessor systems is usually carried out under the assumption of uniform memory reference model. The objective of this paper is to study the performance of multiple bus multiprocessor system in the presence of hot spots. Analytical expressions for the average memory bandwidth and probability of acceptance of prioritized processors have been derived. Two new phenomenon, coined as bumping and knee effect, have been observed in the acceptance probabilities of the processors. The results are validated by simulation results.<>
{"title":"Performance of multiple-bus multiprocessor under non-uniform memory reference","authors":"M. Sayeed, Mohammed Atiquzzaman","doi":"10.1109/MASCOT.1994.284427","DOIUrl":"https://doi.org/10.1109/MASCOT.1994.284427","url":null,"abstract":"Performance evaluation of multiple-bus multiprocessor systems is usually carried out under the assumption of uniform memory reference model. The objective of this paper is to study the performance of multiple bus multiprocessor system in the presence of hot spots. Analytical expressions for the average memory bandwidth and probability of acceptance of prioritized processors have been derived. Two new phenomenon, coined as bumping and knee effect, have been observed in the acceptance probabilities of the processors. The results are validated by simulation results.<<ETX>>","PeriodicalId":288344,"journal":{"name":"Proceedings of International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123362380","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 : 1994-01-31DOI: 10.1109/MASCOT.1994.284429
Xiaodong Zhang, Yong Yan
Parallel computing performance on scalable shared-memory architectures depends primarily on the structure of the interconnection networks linking processors to memory modules and on the efficiency of the memory/cache management systems. While Cache Coherence Non-Uniform Memory Access (CC-NUMA) and Cache Only Memory Access (CC-COMA) are two effective memory systems, and the hierarchical ring structure is an efficient interconnection network in hardware. This paper focuses on comparative performance modeling and the evaluation of CC-NUMA and CC-COMA on a hierarchical ring shared-memory architecture.<>
可扩展共享内存架构上的并行计算性能主要取决于连接处理器和内存模块的互连网络的结构以及内存/缓存管理系统的效率。而Cache Coherence Non-Uniform Memory Access (CC-NUMA)和Cache Only Memory Access (CC-COMA)是两种有效的存储系统，分层环结构是一种高效的硬件互连网络。本文重点研究了CC-NUMA和CC-COMA在分层环形共享内存架构上的性能比较建模和评价。
{"title":"Modeling data migration on CC-NUMA and CC-COMA hierarchical ring architectures","authors":"Xiaodong Zhang, Yong Yan","doi":"10.1109/MASCOT.1994.284429","DOIUrl":"https://doi.org/10.1109/MASCOT.1994.284429","url":null,"abstract":"Parallel computing performance on scalable shared-memory architectures depends primarily on the structure of the interconnection networks linking processors to memory modules and on the efficiency of the memory/cache management systems. While Cache Coherence Non-Uniform Memory Access (CC-NUMA) and Cache Only Memory Access (CC-COMA) are two effective memory systems, and the hierarchical ring structure is an efficient interconnection network in hardware. This paper focuses on comparative performance modeling and the evaluation of CC-NUMA and CC-COMA on a hierarchical ring shared-memory architecture.<<ETX>>","PeriodicalId":288344,"journal":{"name":"Proceedings of International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121592829","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 : 1994-01-31DOI: 10.1109/MASCOT.1994.284385
A. Thakar, W. Cyre
In automatically synthesizing simulation models from informal specifications, the ambiguity of natural language (English) leads to multiple interpretations The authors report on a system, called the Model Generator, which provides visual feedback showing the interpretation of specification statements that have been automatically translated to a knowledge representation called conceptual graphs. The visual feedback is based on a combination of block diagrams and Petri net graphs.<>
{"title":"Visual feedback for validation of informal specifications","authors":"A. Thakar, W. Cyre","doi":"10.1109/MASCOT.1994.284385","DOIUrl":"https://doi.org/10.1109/MASCOT.1994.284385","url":null,"abstract":"In automatically synthesizing simulation models from informal specifications, the ambiguity of natural language (English) leads to multiple interpretations The authors report on a system, called the Model Generator, which provides visual feedback showing the interpretation of specification statements that have been automatically translated to a knowledge representation called conceptual graphs. The visual feedback is based on a combination of block diagrams and Petri net graphs.<<ETX>>","PeriodicalId":288344,"journal":{"name":"Proceedings of International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124537558","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
扫码关注我们
求助内容：
应助结果提醒方式：