Proceedings of the 17th International Conference on Distributed Computing and Networking最新文献_第5页

Shared-object system equilibria: delay and throughput analysis 共享对象系统平衡:延迟和吞吐量分析

Proceedings of the 17th International Conference on Distributed Computing and Networking Pub Date : 2015-08-07 DOI: 10.1145/2833312.2833325

Iosif Salem, E. Schiller, M. Papatriantafilou, P. Tsigas

{"title":"Shared-object system equilibria: delay and throughput analysis","authors":"Iosif Salem, E. Schiller, M. Papatriantafilou, P. Tsigas","doi":"10.1145/2833312.2833325","DOIUrl":"https://doi.org/10.1145/2833312.2833325","url":null,"abstract":"We consider shared-object systems that require their threads to fulfill the system jobs by first acquiring sequentially the objects needed for the jobs and then holding on to them until the job completion. Such systems are in the core of a variety of shared-resource allocation and synchronization systems. This work opens a new perspective to study the expected job delay and throughput analytically, given the possible set of jobs that may join the system dynamically. We identify the system dependencies that cause contention among the threads as they try to acquire the job objects. We use these observations to define the shared-object system equilibria. We note that the system is in equilibrium whenever the rate in which jobs arrive at the system matches the job completion rate. These equilibria consider not only the job delay but also the job throughput, as well as the time in which each thread blocks other threads in order to complete its job. We then further study in detail the thread work cycles and, by using a graph representation of the problem, we are able to propose procedures for estimating equilibria, i.e., discovering the job delay and throughput, as well as the blocking time. To the best of our knowledge, this is a new perspective, that can provide better analytical tools for the problem, in order to estimate performance measures similar to ones that can be acquired through experimentation on working systems and simulations.","PeriodicalId":113772,"journal":{"name":"Proceedings of the 17th International Conference on Distributed Computing and Networking","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134630299","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

Fast consensus under eventually stabilizing message adversaries 最终稳定消息对手下的快速共识

Proceedings of the 17th International Conference on Distributed Computing and Networking Pub Date : 2015-08-04 DOI: 10.1145/2833312.2833323

Manfred Schwarz, Kyrill Winkler, U. Schmid

引用次数: 15

Stabilization and fault-tolerance in presence of unchangeable environment actions 在环境动作不变的情况下具有稳定性和容错性

Proceedings of the 17th International Conference on Distributed Computing and Networking Pub Date : 2015-08-04 DOI: 10.1145/2833312.2833324

Mohammad Roohitavaf, S. Kulkarni

引用次数: 5

Bitcoin meets strong consistency 比特币符合强一致性

Proceedings of the 17th International Conference on Distributed Computing and Networking Pub Date : 2014-12-26 DOI: 10.1145/2833312.2833321

Christian Decker, J. Seidel, Roger Wattenhofer

引用次数: 222

Group mutual exclusion in linear time and space 线性时空中的群互斥

Proceedings of the 17th International Conference on Distributed Computing and Networking Pub Date : 2014-03-21 DOI: 10.1145/2833312.2833316

Yuan He, K. Gopalakrishnan, E. Gafni

引用次数: 7

Proceedings of the 17th International Conference on Distributed Computing and Networking 第十七届分布式计算与网络国际会议论文集

Proceedings of the 17th International Conference on Distributed Computing and Networking Pub Date : 2012-01-03 DOI: 10.1145/2833312

L. Bononi, A. Datta, Stéphane Devismes, Archan Misra

引用次数: 3