Distributed Syst. Eng.最新文献_第8页

Analytical performance modelling of lock management in distributed systems 分布式系统中锁管理的分析性能建模

Distributed Syst. Eng. Pub Date : 1996-03-01 DOI: 10.1088/0967-1846/3/1/008

E. Born

引用次数: 10

Design and evaluation of a connection management mechanism for an ATM-based connectionless service 基于atm的无连接服务的连接管理机制的设计和评估

Distributed Syst. Eng. Pub Date : 1996-03-01 DOI: 10.1088/0967-1846/3/1/007

G. Heijenk, B. Haverkort

引用次数: 7

Performance analysis of parallel simulation on distributed systems 分布式系统并行仿真的性能分析

Distributed Syst. Eng. Pub Date : 1996-03-01 DOI: 10.1088/0967-1846/3/1/004

Y. M. Teo, S. Tay

{"title":"Performance analysis of parallel simulation on distributed systems","authors":"Y. M. Teo, S. Tay","doi":"10.1088/0967-1846/3/1/004","DOIUrl":"https://doi.org/10.1088/0967-1846/3/1/004","url":null,"abstract":"This paper presents an analytical model to evaluate the performance of parallel simulation on distributed computing platforms. The proposed model is formalized by two important time components in parallel and distributed processing: computation time and communication time. A conservative parallel simulation of multistage interconnection networks is used as an example in our analytical model. Performance metrics such as elapsed time, speedup and simulation bandwidth associated with different schemes for partitioning/mapping parallel simulation onto distributed processors are evaluated. Our mathematical analysis identifies the major constituents of simulation overheads in these mapping strategies necessary for improving parallel simulation efficiency. We also show that a perfectly balanced workload distribution may not necessarily translate into better performance. On the contrary, we have shown that a balanced mapping of workload may increase communication overheads resulting in a longer simulation elapsed time. Our performance model has been validated against implementation results from a parallel simulation model. The analytical framework is also practical to evaluate the runtime efficiency of other simulation applications which are based on the conservative paradigm.","PeriodicalId":404872,"journal":{"name":"Distributed Syst. Eng.","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125614983","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

Scalability and performance experiments using synthetic distributed server systems 使用合成分布式服务器系统的可伸缩性和性能实验

Distributed Syst. Eng. Pub Date : 1996-03-01 DOI: 10.1088/0967-1846/3/1/002

C. Woodside, C. Schramm

引用次数: 9

Information flow in the DAMA project beyond database managers: information flow managers 数据库管理器之外的DAMA项目中的信息流:信息流管理器

Distributed Syst. Eng. Pub Date : 1996-03-01 DOI: 10.1088/0967-1846/3/4/006

L. Russell, O. Wolfson, Clement T. Yu

引用次数: 4

Parallel application performance in a shared resource environment 共享资源环境中的并行应用程序性能

Distributed Syst. Eng. Pub Date : 1996-03-01 DOI: 10.1088/0967-1846/3/1/003

Gregory D. Peterson, R. Chamberlain

引用次数: 2

Numerical performability evaluation of a group multicast protocol 组播协议性能的数值评价

Distributed Syst. Eng. Pub Date : 1996-03-01 DOI: 10.1088/0967-1846/3/1/006

Luai M. Malhis, W. Sanders, R. Schlichting

{"title":"Numerical performability evaluation of a group multicast protocol","authors":"Luai M. Malhis, W. Sanders, R. Schlichting","doi":"10.1088/0967-1846/3/1/006","DOIUrl":"https://doi.org/10.1088/0967-1846/3/1/006","url":null,"abstract":"Multicast protocols that provide message ordering and delivery guarantees are becoming increasingly important in distributed system design. However, despite the large number of such protocols, little analytical work has been done concerning their performance, especially in the presence of message loss. This paper illustrates a method for determining the performability of group multicast protocols using stochastic activity networks, a stochastic extension to Petri nets, and reduced base model construction. In particular, we study the performability of one such protocol, called Psync, under a wide variety of workload and message loss probabilities. The specific focus is on measuring two quantities, the stabilization time - that is, the time required for messages to arrive at all hosts - and channel utilization. The analysis shows that Psync works well when message transmissions are frequent, but it exhibits extremely long message stabilization times when transmissions are infrequent and message losses occur. We use this information to suggest a modification to Psync that greatly reduces stabilization time in this situation. The results provide useful insights into the behaviour of Psync, as well as serving as a guide for evaluating the performability of other group multicast protocols.","PeriodicalId":404872,"journal":{"name":"Distributed Syst. Eng.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121597604","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}

引用次数: 11

A global plan policy for coherent co-operation in distributed dynamic load balancing algorithms 分布式动态负载均衡算法中协调合作的全局计划策略

Distributed Syst. Eng. Pub Date : 1995-12-01 DOI: 10.1088/0967-1846/2/4/004

M. Kara

{"title":"A global plan policy for coherent co-operation in distributed dynamic load balancing algorithms","authors":"M. Kara","doi":"10.1088/0967-1846/2/4/004","DOIUrl":"https://doi.org/10.1088/0967-1846/2/4/004","url":null,"abstract":"Distributed-controlled dynamic load balancing algorithms are known to have several advantages over centralized algorithms such as scalability, and fault tolerance. Distributed implies that the control is decentralized and that a copy of the algorithm (called a scheduler) is replicated on each host of the network. However, distributed control also contributes to the lack of global goals and lack of coherence. This paper presents a new algorithm called DGP (decentralized global plans) that addresses the problem of coherence and co-ordination in distributed dynamic load balancing algorithms. The DGP algorithm is based on a strategy called global plans (GP), and aims at maintaining all computational loads of a distributed system within a band called delta . The rationale for the design of DGP is to allow each scheduler to consider the actions of its peer schedulers. With this level of co-ordination, the schedulers can act more as a coherent team. This new approach first explicitly specifies a global goal and then designs a strategy around this global goal such that each scheduler (i) takes into account local decisions made by other schedulers; (ii) takes into account the effect of its local decisions on the overall system and (iii) ensures load balancing. An experimental evaluation of DGP with two other well known dynamic load balancing algorithms published in the literature shows that DGP performs consistently better. More significantly, the results indicate that the global plan approach provides a better framework for the design of distributed dynamic load balancing algorithms.","PeriodicalId":404872,"journal":{"name":"Distributed Syst. Eng.","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123690869","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

The flexible integration of machine objects within distributed manufacturing systems 分布式制造系统中机器对象的灵活集成

Distributed Syst. Eng. Pub Date : 1995-12-01 DOI: 10.1088/0967-1846/2/4/001

J. Edwards, I. Coutts

{"title":"The flexible integration of machine objects within distributed manufacturing systems","authors":"J. Edwards, I. Coutts","doi":"10.1088/0967-1846/2/4/001","DOIUrl":"https://doi.org/10.1088/0967-1846/2/4/001","url":null,"abstract":"Manufacturing processes are required to adapt to change as businesses respond to global competition. The paper describes a framework for building distributed manufacturing processes based on an integrating infrastructure. Through a decomposition based on application function, application interoperation and application interaction, proposals are made for structuring the integration software required to flexibly implement distributed systems which can evolve to support required change. The paper describes the architecture used in a proof of concept implementation of a machine vision process made up of distributed application objects. Support for change is demonstrated through comparison with a conventional distributed system which does not make use of the services of an integrating infrastructure. In describing the system architecture, requirements for `soft` CIM building blocks which can be `plugged` into an integrating infrastructure are defined. This work together with a range of approaches to application interoperation proposed by researchers at the MSI Research Institute are being further investigated through an EPSRC funded project entitled `Manufacturing Software Interoperability: Steps towards Interoperating Distributed Objects`.","PeriodicalId":404872,"journal":{"name":"Distributed Syst. Eng.","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122687382","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

An introduction to snapshot algorithms in distributed computing 介绍分布式计算中的快照算法

Distributed Syst. Eng. Pub Date : 1995-12-01 DOI: 10.1088/0967-1846/2/4/005

A. Kshemkalyani, M. Raynal, M. Singhal

引用次数: 57