首页 > 最新文献

Proceedings of International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems最新文献

英文 中文
Trace-driven simulation of data alignment and other factors affecting update and invalidate based coherent memory 跟踪驱动的数据对齐仿真和其他影响基于相干存储器更新和失效的因素
E. Markatos, C. Chronaki
The exploitation of locality of reference in shared memory multiprocessors is one of the most important problems in parallel processing today. Locality can be managed in several levels: hardware, operating system, runtime environment of the compiler, and user level. In this paper we investigate the problem of exploiting locality at the operating system level and its interactions with the compiler and the architecture. Our main conclusion, based on trace-driven simulations of real applications, is that exploitation of locality is effective only if all three levels cooperate.<>
共享内存多处理器中引用局部性的利用是当前并行处理中最重要的问题之一。局部性可以在几个级别进行管理:硬件、操作系统、编译器的运行时环境和用户级别。在本文中,我们研究了在操作系统级别上利用局部性的问题及其与编译器和体系结构的交互。基于对实际应用的跟踪驱动模拟,我们的主要结论是,只有在所有三个层次合作的情况下,局部性的利用才是有效的。
{"title":"Trace-driven simulation of data alignment and other factors affecting update and invalidate based coherent memory","authors":"E. Markatos, C. Chronaki","doi":"10.1109/MASCOT.1994.284449","DOIUrl":"https://doi.org/10.1109/MASCOT.1994.284449","url":null,"abstract":"The exploitation of locality of reference in shared memory multiprocessors is one of the most important problems in parallel processing today. Locality can be managed in several levels: hardware, operating system, runtime environment of the compiler, and user level. In this paper we investigate the problem of exploiting locality at the operating system level and its interactions with the compiler and the architecture. Our main conclusion, based on trace-driven simulations of real applications, is that exploitation of locality is effective only if all three levels cooperate.<<ETX>>","PeriodicalId":288344,"journal":{"name":"Proceedings of International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems","volume":"12 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":"114856486","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}
引用次数: 7
Approximate analysis of a multi-class open queueing network with class blocking and push-out 一类具有类阻塞和推出的多类开放排队网络的近似分析
T. Atmaca, H. Perros, Y. Dallery
We study a multi-class queueing network which consists of a finite capacity node (node 0) linked to M parallel finite capacity nodes (nodes 1 to M). M classes of customers are assumed. All customers first join node 0. A class i customer after completion of its service at node 0 always joins the ith node. All service times and inter-arrival times are assumed to be exponentially distributed. The service priority at node 0 is head-of-line with preemption. When node i (i=1, 2, ..., M) is full, node 0 cannot process class i customers. In addition to the service priority at node 0, push-out is employed. That is, a customer that arrives at node 0 when the node is full, takes the space of a customer which has the lowest priority among the customers already in the node. If all customers in the node have a higher or equal priority, then the arriving customer is lost. This queueing network is analyzed approximately by decomposing it into individual nodes, and then analyzing each node separately. Node 0 is analyzed using a class by class decomposition. The approximation algorithm has been validated using simulation, and the approximate results have a good error.<>
本文研究了一个多类排队网络,该网络由一个有限容量节点(节点0)与M个并行有限容量节点(节点1 ~ M)相连。所有客户首先加入节点0。第i类客户在节点0完成服务后总是加入第i个节点。假定所有服务时间和到达间隔时间呈指数分布。节点0处的服务优先级为具有抢占的排队优先级。当节点i (i= 1,2,…), M)已满,节点0无法处理第i类客户。除了节点0的服务优先级外,还采用了推出。即客户到达节点0当节点已满,需要客户的空间已经客户之间的优先级最低的节点。如果节点中的所有客户具有更高或相等的优先级,则到达的客户将丢失。对该排队网络进行近似分析,将其分解为单个节点,然后对每个节点分别进行分析。节点0使用一个类一个类的分解进行分析。仿真验证了该近似算法的有效性,近似结果具有较好的误差。
{"title":"Approximate analysis of a multi-class open queueing network with class blocking and push-out","authors":"T. Atmaca, H. Perros, Y. Dallery","doi":"10.1109/MASCOT.1994.284441","DOIUrl":"https://doi.org/10.1109/MASCOT.1994.284441","url":null,"abstract":"We study a multi-class queueing network which consists of a finite capacity node (node 0) linked to M parallel finite capacity nodes (nodes 1 to M). M classes of customers are assumed. All customers first join node 0. A class i customer after completion of its service at node 0 always joins the ith node. All service times and inter-arrival times are assumed to be exponentially distributed. The service priority at node 0 is head-of-line with preemption. When node i (i=1, 2, ..., M) is full, node 0 cannot process class i customers. In addition to the service priority at node 0, push-out is employed. That is, a customer that arrives at node 0 when the node is full, takes the space of a customer which has the lowest priority among the customers already in the node. If all customers in the node have a higher or equal priority, then the arriving customer is lost. This queueing network is analyzed approximately by decomposing it into individual nodes, and then analyzing each node separately. Node 0 is analyzed using a class by class decomposition. The approximation algorithm has been validated using simulation, and the approximate results have a good error.<<ETX>>","PeriodicalId":288344,"journal":{"name":"Proceedings of International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems","volume":"1 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":"114232708","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}
引用次数: 1
Efficient technique for performance analysis of locking protocols 锁协议性能分析的有效技术
S. Hung, K. Lam, K. Lam
The validity of many analytic studies of the performance of database systems are often hampered by the many approximations made. This is especially true of the way the block queue delays and deadlocks have been handled. An efficient approach to the derivation of the blocking delays of transactions under the static and dynamic two phase locking protocols is given. The problem of deadlocks which has either been neglected or assumed to be of cycle-length two (involving two transactions only) has also been tackled with some degree of success. The analysis is based on simple combinatorial arguments and probability theory. MVA techniques are then applied to the two models. Several conclusions can be drawn regarding the behaviour of the database systems. The analytic results show remarkable good agreement with simulation results.<>
许多数据库系统性能分析研究的有效性经常受到许多近似的阻碍。处理块队列延迟和死锁的方式尤其如此。给出了静态和动态两阶段锁定协议下事务阻塞延迟的一种有效推导方法。死锁的问题要么被忽略,要么被假定为周期长度为2的问题(只涉及两个事务)也得到了一定程度的成功解决。分析是基于简单的组合论证和概率论。然后将MVA技术应用于这两个模型。关于数据库系统的行为可以得出几个结论。分析结果与仿真结果吻合较好。
{"title":"Efficient technique for performance analysis of locking protocols","authors":"S. Hung, K. Lam, K. Lam","doi":"10.1109/MASCOT.1994.284410","DOIUrl":"https://doi.org/10.1109/MASCOT.1994.284410","url":null,"abstract":"The validity of many analytic studies of the performance of database systems are often hampered by the many approximations made. This is especially true of the way the block queue delays and deadlocks have been handled. An efficient approach to the derivation of the blocking delays of transactions under the static and dynamic two phase locking protocols is given. The problem of deadlocks which has either been neglected or assumed to be of cycle-length two (involving two transactions only) has also been tackled with some degree of success. The analysis is based on simple combinatorial arguments and probability theory. MVA techniques are then applied to the two models. Several conclusions can be drawn regarding the behaviour of the database systems. The analytic results show remarkable good agreement with simulation results.<<ETX>>","PeriodicalId":288344,"journal":{"name":"Proceedings of International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems","volume":"17 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":"114406918","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}
引用次数: 1
The feasibility of using compression to increase memory system performance 利用压缩技术提高存储系统性能的可行性
Jenlong Wang, R. Quong
We investigate the feasibility of using instruction compression at some level in a multi-level memory hierarchy to increase memory system performance. Compression effectively increases the memory size and the line size reducing the miss rate at the expense of increased access latency due to decompression delays. We analytically evaluate the impact of compression on the average memory access time for various memory systems and compression approaches. Our results show the benefit of using compression is sensitive to the miss rates and miss penalties at the point of compression and to a lesser extent the amount of compression possible. For high performance workstations of today, compression already shows promise; as miss penalties increase in future, compression will only become more feasible.<>
我们研究了在多级存储器层次结构中使用指令压缩来提高存储器系统性能的可行性。压缩有效地增加了内存大小和行大小,减少了丢失率,但代价是由于解压缩延迟而增加了访问延迟。我们分析评估压缩对各种内存系统和压缩方法的平均内存访问时间的影响。我们的结果表明,使用压缩的好处是对压缩点的缺失率和缺失惩罚敏感,并且在较小程度上对可能的压缩量敏感。对于今天的高性能工作站,压缩已经显示出了希望;随着未来未命中惩罚的增加,压缩只会变得更加可行。
{"title":"The feasibility of using compression to increase memory system performance","authors":"Jenlong Wang, R. Quong","doi":"10.1109/MASCOT.1994.284438","DOIUrl":"https://doi.org/10.1109/MASCOT.1994.284438","url":null,"abstract":"We investigate the feasibility of using instruction compression at some level in a multi-level memory hierarchy to increase memory system performance. Compression effectively increases the memory size and the line size reducing the miss rate at the expense of increased access latency due to decompression delays. We analytically evaluate the impact of compression on the average memory access time for various memory systems and compression approaches. Our results show the benefit of using compression is sensitive to the miss rates and miss penalties at the point of compression and to a lesser extent the amount of compression possible. For high performance workstations of today, compression already shows promise; as miss penalties increase in future, compression will only become more feasible.<<ETX>>","PeriodicalId":288344,"journal":{"name":"Proceedings of International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems","volume":"115 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":"116021929","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}
引用次数: 9
BONeS DESIGNER: a graphical environment for discrete-event modeling and simulation BONeS DESIGNER:用于离散事件建模和仿真的图形环境
S. Schaffer, W. LaRue
The Block Oriented Network Simulator (BONeS) DESIGNER provides a graphical environment for modeling and discrete-event simulation of computer and communication networks, distributed computer systems, and computer architectures. DESIGNER uses a hierarchical data flow block diagram modeling paradigm which provides for definition of data structures that flow between blocks. This modeling paradigm provides sufficient flexibility to model and simulate a broad range discrete-event systems, including computer network and distributed processing systems.<>
面向块的网络模拟器(BONeS) DESIGNER为计算机和通信网络、分布式计算机系统和计算机体系结构的建模和离散事件仿真提供了一个图形化环境。DESIGNER使用分层数据流框图建模范例,该范例提供了在块之间流动的数据结构的定义。这种建模范例提供了足够的灵活性来建模和模拟广泛的离散事件系统,包括计算机网络和分布式处理系统
{"title":"BONeS DESIGNER: a graphical environment for discrete-event modeling and simulation","authors":"S. Schaffer, W. LaRue","doi":"10.1109/MASCOT.1994.284397","DOIUrl":"https://doi.org/10.1109/MASCOT.1994.284397","url":null,"abstract":"The Block Oriented Network Simulator (BONeS) DESIGNER provides a graphical environment for modeling and discrete-event simulation of computer and communication networks, distributed computer systems, and computer architectures. DESIGNER uses a hierarchical data flow block diagram modeling paradigm which provides for definition of data structures that flow between blocks. This modeling paradigm provides sufficient flexibility to model and simulate a broad range discrete-event systems, including computer network and distributed processing systems.<<ETX>>","PeriodicalId":288344,"journal":{"name":"Proceedings of International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems","volume":"55 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":"131830297","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}
引用次数: 9
FAST: a functional algorithm simulation testbed FAST:一个功能算法仿真试验台
M. Dikaiakos, Anne Rogers, K. Steiglitz
We extend the practical range of simulations of parallel executions by "functional algorithm simulation," that is, simulation without actually performing most of the numerical computations involved. We achieve this by introducing a new approach for generating and collecting communication and computation characteristics for a class of parallel scientific algorithms. We describe FAST (Fast Algorithm Simulation Testbed), a prototype system that we developed to implement and test our approach. FAST overcomes some of the difficulties imposed by the very high complexity of interesting scientific algorithms, collects profile information representative of the algorithms rather than the underlying mapping strategies and hardware design choices, and allows a performance assessment of parallel machines with various sites and different interconnection schemes.<>
我们通过“功能算法模拟”扩展了并行执行模拟的实际范围,也就是说,不实际执行所涉及的大多数数值计算的模拟。我们通过引入一种新的方法来生成和收集一类并行科学算法的通信和计算特征来实现这一目标。我们描述了FAST(快速算法仿真试验台),这是我们开发的一个原型系统,用于实现和测试我们的方法。FAST克服了一些由有趣的科学算法的非常高的复杂性所带来的困难,收集了代表算法的概要信息,而不是底层的映射策略和硬件设计选择,并允许对具有各种站点和不同互连方案的并行机器进行性能评估。
{"title":"FAST: a functional algorithm simulation testbed","authors":"M. Dikaiakos, Anne Rogers, K. Steiglitz","doi":"10.1109/MASCOT.1994.284432","DOIUrl":"https://doi.org/10.1109/MASCOT.1994.284432","url":null,"abstract":"We extend the practical range of simulations of parallel executions by \"functional algorithm simulation,\" that is, simulation without actually performing most of the numerical computations involved. We achieve this by introducing a new approach for generating and collecting communication and computation characteristics for a class of parallel scientific algorithms. We describe FAST (Fast Algorithm Simulation Testbed), a prototype system that we developed to implement and test our approach. FAST overcomes some of the difficulties imposed by the very high complexity of interesting scientific algorithms, collects profile information representative of the algorithms rather than the underlying mapping strategies and hardware design choices, and allows a performance assessment of parallel machines with various sites and different interconnection schemes.<<ETX>>","PeriodicalId":288344,"journal":{"name":"Proceedings of International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems","volume":"222 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":"121230392","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}
引用次数: 20
Coreference detection in automatic analysis of specifications 规范自动分析中的共参检测
S. Shankaranarayanan, W. Cyre
An English language description of a system is typically composed of many English sentences. Consider that each English language sentence is parsed and stored in the form of a conceptual graph that represents the semantics of the sentence. Since each of these conceptual graphs carries information only about the sentence it represents, the set of conceptual graphs must be "joined" logically in order to develop a single conceptual graph that represents the entire system. The process of identifying concept nodes in the conceptual graphs at which joins should be performed is referred to as coreference detection. The authors present a technique to perform coreference detection of object concepts (devices and values).<>
系统的英语语言描述通常由许多英语句子组成。假设每个英语句子都以表示句子语义的概念图的形式进行解析和存储。由于这些概念图中的每一个都只携带它所代表的句子的信息,为了形成一个代表整个系统的概念图,这组概念图必须在逻辑上“连接”起来。在概念图中识别应该执行连接的概念节点的过程称为共引用检测。作者提出了一种执行对象概念(设备和值)的共参考检测的技术。
{"title":"Coreference detection in automatic analysis of specifications","authors":"S. Shankaranarayanan, W. Cyre","doi":"10.1109/MASCOT.1994.284386","DOIUrl":"https://doi.org/10.1109/MASCOT.1994.284386","url":null,"abstract":"An English language description of a system is typically composed of many English sentences. Consider that each English language sentence is parsed and stored in the form of a conceptual graph that represents the semantics of the sentence. Since each of these conceptual graphs carries information only about the sentence it represents, the set of conceptual graphs must be \"joined\" logically in order to develop a single conceptual graph that represents the entire system. The process of identifying concept nodes in the conceptual graphs at which joins should be performed is referred to as coreference detection. The authors present a technique to perform coreference detection of object concepts (devices and values).<<ETX>>","PeriodicalId":288344,"journal":{"name":"Proceedings of International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems","volume":"21 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":"124177378","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}
引用次数: 2
A flexible graphical user interface for performance modeling 用于性能建模的灵活图形用户界面
Yi-Bing Lin, Dan Daly
We identify three goals for the graphical user interface (GUI) of a network simulation environment: user friendliness, model re-usability, and application extensibility. We address the user friendliness issue by proposing a simple yet efficient approach to setup parameters for the simulation models. We address the application extensibility issue by a two-layer GUI architecture. The two layers are loosely-coupled, and the first layer can be easily replaced (without affecting the other components of the simulation environment). We address the model re-usability issue by subnetworks. Unlike most existing simulation packages where subnetwork is simply a method to group the nodes, the subnetwork construct in our approach is an integral part of the simulation environment (i.e., all operations for a basic node also apply to a subnetwork). The port concept is used to explicitly define the I/O relationship between a subnetwork and the outside world. Parameter dialog boxes are used to set up the parameters for a subnetwork conveniently. Finally, a simple stack mechanism is proposed to measure subnetwork-wide output statistics.<>
我们确定了网络仿真环境的图形用户界面(GUI)的三个目标:用户友好性、模型可重用性和应用程序可扩展性。我们通过提出一种简单而有效的方法来设置仿真模型的参数来解决用户友好性问题。我们通过两层GUI架构来解决应用程序的可扩展性问题。这两层是松耦合的,第一层可以很容易地替换(而不会影响模拟环境的其他组件)。我们通过子网解决了模型的重用性问题。与大多数现有的仿真软件包不同,其中子网只是对节点进行分组的一种方法,我们方法中的子网构造是仿真环境的一个组成部分(即,对基本节点的所有操作也适用于子网)。端口概念用于显式定义子网与外部世界之间的I/O关系。通过参数对话框,可以方便地设置子网的相关参数。最后,提出了一种简单的堆栈机制来测量子网范围内的输出统计
{"title":"A flexible graphical user interface for performance modeling","authors":"Yi-Bing Lin, Dan Daly","doi":"10.1109/MASCOT.1994.284423","DOIUrl":"https://doi.org/10.1109/MASCOT.1994.284423","url":null,"abstract":"We identify three goals for the graphical user interface (GUI) of a network simulation environment: user friendliness, model re-usability, and application extensibility. We address the user friendliness issue by proposing a simple yet efficient approach to setup parameters for the simulation models. We address the application extensibility issue by a two-layer GUI architecture. The two layers are loosely-coupled, and the first layer can be easily replaced (without affecting the other components of the simulation environment). We address the model re-usability issue by subnetworks. Unlike most existing simulation packages where subnetwork is simply a method to group the nodes, the subnetwork construct in our approach is an integral part of the simulation environment (i.e., all operations for a basic node also apply to a subnetwork). The port concept is used to explicitly define the I/O relationship between a subnetwork and the outside world. Parameter dialog boxes are used to set up the parameters for a subnetwork conveniently. Finally, a simple stack mechanism is proposed to measure subnetwork-wide output statistics.<<ETX>>","PeriodicalId":288344,"journal":{"name":"Proceedings of International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems","volume":"16 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":"116637132","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}
引用次数: 10
An analysis of space priority queueing in ATM switches ATM交换机空间优先级排队分析
K. Reid, R. Bunt
High-speed packet switched networks such as B-ISDN require algorithms to manage the flow of traffic into and through the network. End-to-end congestion control algorithms will do much to ensure that overload periods are minimized, but intelligent buffering decisions at internal nodes may aid in managing congestion by shifting cell loss to lower priority traffic. The authors describe a simulation study of three space priority queueing algorithms under realistic traffic models, and show that the performance of these algorithms depends on the shape and type of the traffic. The results of this research suggest that space priority algorithms, when combined with other congestion control algorithms, can aid in supporting acceptable quality of service for the users of the network.<>
高速分组交换网络(如B-ISDN)需要算法来管理进入和通过网络的流量。端到端拥塞控制算法将在很大程度上确保最小化过载周期,但内部节点的智能缓冲决策可能有助于通过将单元损失转移到较低优先级的流量来管理拥塞。本文对现实交通模型下的三种空间优先排队算法进行了仿真研究,结果表明,这些算法的性能取决于交通的形状和类型。本研究的结果表明,当空间优先算法与其他拥塞控制算法相结合时,可以帮助为网络用户提供可接受的服务质量。
{"title":"An analysis of space priority queueing in ATM switches","authors":"K. Reid, R. Bunt","doi":"10.1109/MASCOT.1994.284444","DOIUrl":"https://doi.org/10.1109/MASCOT.1994.284444","url":null,"abstract":"High-speed packet switched networks such as B-ISDN require algorithms to manage the flow of traffic into and through the network. End-to-end congestion control algorithms will do much to ensure that overload periods are minimized, but intelligent buffering decisions at internal nodes may aid in managing congestion by shifting cell loss to lower priority traffic. The authors describe a simulation study of three space priority queueing algorithms under realistic traffic models, and show that the performance of these algorithms depends on the shape and type of the traffic. The results of this research suggest that space priority algorithms, when combined with other congestion control algorithms, can aid in supporting acceptable quality of service for the users of the network.<<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":"1993-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127578400","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}
引用次数: 2
Discrete time open queueing networks with feedback, bulk arrivals and services 具有反馈、批量到达和服务的离散时间开放排队网络
C. Vu Duy
An open queueing network system of N nodes with Geo(A/sub i/) input and Geo(S/sub i/) service at every node is studied. Geo(A/sub i/) and Geo(S/sub i/) mean compound geometric. First the author is interested in the cases of eventual independent departure from every node as the isolated queueing system Geo(A/sub i/)/Geo(S/sub i/)/1. Then the author looks for a configuration of the network which is product form solution compatible. Lastly, the necessary and sufficient condition for an open Markovian queueing network of N nodes to have a solution of product form is proved. A certain number of open Markovian queueing networks which have a solution of product form are found.<>
研究了一个有N个节点的开放排队网络系统,每个节点上都有Geo(A/sub i/)输入和Geo(S/sub i/)服务。Geo(A/下标i/)和Geo(S/下标i/)表示复合几何。首先,作者对孤立排队系统Geo(A/sub i/)/Geo(S/sub i/)/1最终独立离开每个节点的情况感兴趣。然后寻找一种产品形态解兼容的网络配置。最后,证明了N个节点的开放马尔可夫排队网络具有积形式解的充分必要条件。得到了一定数量的具有积形式解的开放马尔可夫排队网络。
{"title":"Discrete time open queueing networks with feedback, bulk arrivals and services","authors":"C. Vu Duy","doi":"10.1109/MASCOT.1994.284384","DOIUrl":"https://doi.org/10.1109/MASCOT.1994.284384","url":null,"abstract":"An open queueing network system of N nodes with Geo(A/sub i/) input and Geo(S/sub i/) service at every node is studied. Geo(A/sub i/) and Geo(S/sub i/) mean compound geometric. First the author is interested in the cases of eventual independent departure from every node as the isolated queueing system Geo(A/sub i/)/Geo(S/sub i/)/1. Then the author looks for a configuration of the network which is product form solution compatible. Lastly, the necessary and sufficient condition for an open Markovian queueing network of N nodes to have a solution of product form is proved. A certain number of open Markovian queueing networks which have a solution of product form are found.<<ETX>>","PeriodicalId":288344,"journal":{"name":"Proceedings of International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114855242","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}
引用次数: 0
期刊
Proceedings of International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1