Article

Free access

On the stochastic structure of parallelism and synchronization models for distributed algorithms

Author:

Brigitte PlateauAuthors Info & Claims

SIGMETRICS '85: Proceedings of the 1985 ACM SIGMETRICS conference on Measurement and modeling of computer systems

Pages 147 - 154

https://doi.org/10.1145/317795.317819

Published: 01 August 1985 Publication History

PDF eReader

Abstract

In this paper a new technique to handle complex Markov models is presented. This method is based on a description using stochastic automatas and is dedicated to distributed algorithms modelling. One example of a mutual exclusion algorithm in a distributed environment is extensively analysed. The mathematical analysis is based on tensor algebra for matrices.

References

[1]

M.Davio: "Kronecker products and shuffle algebra':, IEEE Transactions on Computers, vol C-30, no 2, Feb 81.

Digital Library

Google Scholar

[2]

A. Chesnais, E. Gelenbe, l.Mitrani, "On the modelling of parallel access to shared data", Commgnications of the ACM, Mars 83, Vo/. ~6, no 3.

Digital Library

Google Scholar

[3]

E Oelenbe, I. Mitrani : "Control policies in CSMA local area network: Ethcrnct control", Proc. of Sigmetrics Conference on Measurement and Modelling of Computer systems, 82

Digital Library

Google Scholar

[4]

G.Harrus: "Evaluation de problemes de communteat/ores dans los systemes repartis", These de troisieme cycle, Juillet 84, Universite de Paris-Sud.

Google Scholar

[5]

N.Mazars : "De l'Independance and des depcndances stochastiques en thdorte de la fiabillte ", These de troiaie cycle. Universite Past Sabatier, Toulose, June 81.

Google Scholar

[6]

I.Mitrani: "Fixed point approximation for distributed systems", tarot, lnternatlonal Workshop on applied mathematics and pcrformgnge reliabigity models of computer and communication systerns.Pise Sept 83.

Digital Library

Google Scholar

[7]

M.Molloy: "Performance analysis using stochastic Petri Nets", fEEE Transactions on Computers, vol C-31, no 9, S~pt 88,

Google Scholar

[8]

B.Plateau, A.Staphylopatis: "Modelling of the ~arallel resolution of a numerical problem on a locally tstributed computing system ", Peoc, ACM Sigmetrics Conference on Measurement and Modelling of Computer systems, 81.

Digital Library

Google Scholar

[9]

B.Plateau: "De i'gvaluation du parall~lisme and de la synchronisation", These d'etat, Universite de Paris-Steal, 91405 Orsay, France, Nov 1985.

Google Scholar

[10]

G.Ricart, A.Agrawala. "An optimal algorithm for mutual exclusion in computer network", Communestions of he ACId, Vol 24, no l, Jan 81

Digital Library

Google Scholar

[11]

M.Vernon. E. de Souza e Silva, G.Estrin: " Performance evaluation of asynchronous concurrent systems: the UCLA Graph model ofbehavior", Proc. of Performance 83 Conference, Ms.land. North Holland,

Digital Library

Google Scholar

Cited By

View all

Buchholz PBlume A(2022)Dynamic Fault Trees with Correlated Failure Times - Modeling and Efficient Analysis -2022 41st International Symposium on Reliable Distributed Systems (SRDS)10.1109/SRDS55811.2022.00027(201-212)Online publication date: Sep-2022
https://doi.org/10.1109/SRDS55811.2022.00027
Denzler PBlieberger JKastner W(2022)Utilising Kronecker Algebra to Detect Unexpected Behaviour in Distributed Systems2022 IEEE 25th International Symposium On Real-Time Distributed Computing (ISORC)10.1109/ISORC52572.2022.9812832(1-8)Online publication date: 17-May-2022
https://doi.org/10.1109/ISORC52572.2022.9812832
Naumov VSamouylov K(2021)Resource System with Losses in a Random EnvironmentMathematics10.3390/math92126859:21(2685)Online publication date: 22-Oct-2021
https://doi.org/10.3390/math9212685
Show More Cited By

Index Terms

On the stochastic structure of parallelism and synchronization models for distributed algorithms

Recommendations

On the stochastic structure of parallelism and synchronization models for distributed algorithms

In this paper a new technique to handle complex Markov models is presented. This method is based on a description using stochastic automatas and is dedicated to distributed algorithms modelling. One example of a mutual exclusion algorithm in a ...
Integrating Distributed Algorithms into Distributed Systems

A distributed algorithm is often used as a part of a larger distributed system. Usually, the properties of an algorithm are proven for the algorithm in isolation. Then, it is not obvious how the algorithm behaves when integrated into a larger system. In ...
Distributed Algorithms for Topic Models

We describe distributed algorithms for two widely-used topic models, namely the Latent Dirichlet Allocation (LDA) model, and the Hierarchical Dirichet Process (HDP) model. In our distributed algorithms the data is partitioned across separate processors ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

SIGMETRICS '85: Proceedings of the 1985 ACM SIGMETRICS conference on Measurement and modeling of computer systems

August 1985

203 pages

ISBN:0897911695

DOI:10.1145/317795

Chairmen:
Herbert D. Schwetman
MCC, Austin, TX
,
Jeffrey A. Brumfield
Univ. of Texas
,
Daniel A. Reed
Univ. of Illinois
,
Editor:
Blaine D. Gaither
New Mexico Institute of Technology, Socorro

ACM SIGMETRICS Performance Evaluation Review Volume 13, Issue 2
Aug. 1985
205 pages
ISSN:0163-5999
DOI:10.1145/317786
Chairmen:
Herbert D. Schwetman
MCC
,
Jeffrey A. Brumfield
Univ. of Texas
,
Daniel A. Reed
Univ. of Illinois
,
Editor:
Blaine D. Gaither
New Mexico Institute of Technology, Socorro
Issue’s Table of Contents

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 August 1985

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 459 of 2,691 submissions, 17%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

246
Total Citations
View Citations
769
Total Downloads

Downloads (Last 12 months)85
Downloads (Last 6 weeks)11

Reflects downloads up to 11 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Buchholz PBlume A(2022)Dynamic Fault Trees with Correlated Failure Times - Modeling and Efficient Analysis -2022 41st International Symposium on Reliable Distributed Systems (SRDS)10.1109/SRDS55811.2022.00027(201-212)Online publication date: Sep-2022
https://doi.org/10.1109/SRDS55811.2022.00027
Denzler PBlieberger JKastner W(2022)Utilising Kronecker Algebra to Detect Unexpected Behaviour in Distributed Systems2022 IEEE 25th International Symposium On Real-Time Distributed Computing (ISORC)10.1109/ISORC52572.2022.9812832(1-8)Online publication date: 17-May-2022
https://doi.org/10.1109/ISORC52572.2022.9812832
Naumov VSamouylov K(2021)Resource System with Losses in a Random EnvironmentMathematics10.3390/math92126859:21(2685)Online publication date: 22-Oct-2021
https://doi.org/10.3390/math9212685
Piazza CRossi S(2021)Reasoning About Proportional LumpabilityQuantitative Evaluation of Systems10.1007/978-3-030-85172-9_20(372-390)Online publication date: 23-Aug-2021
https://dl.acm.org/doi/10.1007/978-3-030-85172-9_20
Marin APiazza CRossi S(2019)Proportional LumpabilityFormal Modeling and Analysis of Timed Systems10.1007/978-3-030-29662-9_16(265-281)Online publication date: 27-Aug-2019
https://dl.acm.org/doi/10.1007/978-3-030-29662-9_16
Sodsong WMittermayr RPark YBurgstaller BBlieberger J(2017)Lazy Parallel Kronecker Algebra-Operations on Heterogeneous MulticoresEuro-Par 2017: Parallel Processing10.1007/978-3-319-64203-1_39(538-552)Online publication date: 1-Aug-2017
https://doi.org/10.1007/978-3-319-64203-1_39
Mittermayr RBlieberger J(2016)Kronecker Algebra for Static Analysis of Barriers in AdaProceedings of the 21st Ada-Europe International Conference on Reliable Software Technologies --- Ada-Europe 2016 - Volume 969510.1007/978-3-319-39083-3_10(145-159)Online publication date: 13-Jun-2016
https://dl.acm.org/doi/10.1007/978-3-319-39083-3_10
Sbeity IDbouk M(2014)Software performance engineering using UML2SAN: Deadlock prediction of funds transfer2014 9th International Conference on Computer Engineering & Systems (ICCES)10.1109/ICCES.2014.7030978(318-323)Online publication date: Dec-2014
https://doi.org/10.1109/ICCES.2014.7030978
Oleksinski LCorrea CDotti FSales A(2013)A CTL model checker for stochastic automata networksProceedings of the 10th international conference on Quantitative Evaluation of Systems10.1007/978-3-642-40196-1_25(286-289)Online publication date: 27-Aug-2013
https://dl.acm.org/doi/10.1007/978-3-642-40196-1_25
Sales AWainer GMosterman P(2012)SAN lite-solverProceedings of the 2012 Symposium on Theory of Modeling and Simulation - DEVS Integrative M&S Symposium10.5555/2346616.2346660(1-8)Online publication date: 26-Mar-2012
https://dl.acm.org/doi/10.5555/2346616.2346660
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

On the stochastic structure of parallelism and synchronization models for distributed algorithms

Integrating Distributed Algorithms into Distributed Systems

Distributed Algorithms for Topic Models