Home »
Academic Articles & Research Papers
Showing 20 of 3,463 academic articles
Miron Livny, Myron Melman • ACM SIGMETRICS Performance Evaluation Review
(1982)
Three different load balancing algorithms for distributed systems that consist of a number of identical processors and a CSMA communication system are presented in this paper. Some of the properties of a multi-resource system and the balanc...
OPENALEX
DOI: https://doi.org/10.1145/1010631.801689
Patrick Th. Eugster, Rachid Guerraoui, Anne-Marie Kermarrec, Laurent Massoulié • Computer
(2004)
Easy to deploy, robust, and highly resilient to failures, epidemic algorithms are a potentially effective mechanism for propagating information in large peer-to-peer systems deployed on Internet or ad hoc networks. It is possible to adjust ...
OPENALEX
Open Access
DOI: https://doi.org/10.1109/mc.2004.1297243
Xuezheng Liu, Zhenyu Guo, Xi Wang, Feibo Chen et al. (2008)
Testing large-scale distributed systems is a challenge, because some errors manifest themselves only after a distributed sequence of events that involves machine and network failures. D³S is a checker that allows developers to specify predi...
OPENALEX
Sina Niedermaier, Falko Koetter, Andreas Freymann, Stefan Wagner • Lecture notes in computer science
(2019)
OPENALEX
Open Access
DOI: https://doi.org/10.1007/978-3-030-33702-5_3
Victor Lesser, Daniel D. Corkill • IEEE Transactions on Systems Man and Cybernetics
(1981)
A new approach for structuring distributed processing systems, called functionally accurate, cooperative (FA/C), is proposed. The approach differs from conventional ones in its emphasis on handling distribution-caused uncertainty and errors...
OPENALEX
DOI: https://doi.org/10.1109/tsmc.1981.4308581
Prof. Ravish Kumar Mishra Dr. JaiPrakash Sirur • Zenodo (CERN European Organization for Nuclear Research)
(2012)
Physically, a Distributed System consists of a set of processors, with a collection of local storage mechanisms associated with each processor. A processor is able to execute programs that access and manipulate the local storage, where the ...
OPENALEX
cc-by
DOI: https://doi.org/10.5281/zenodo.7116348
Darren Dao, Jeannie R. Albrecht, Charles Edwin Killian, Amin M. Vahdat • Lecture notes in computer science
(2009)
OPENALEX
DOI: https://doi.org/10.1007/978-3-642-00722-4_8
Maysam Yabandeh, Nikola Knežević, Dejan Kostić, Viktor Kunčak • Infoscience (Ecole Polytechnique Fédérale de Lausanne)
(2009)
We propose a new approach for developing and deploying distributed systems, in which nodes predict distributed consequences of their actions, and use this information to detect and avoid errors. Each node continuously runs a state explorati...
OPENALEX
cc-by-nc-nd
Albert Fleischmann (1994)
OPENALEX
Gregor von Bochmann • Springer eBooks
(1983)
OPENALEX
DOI: https://doi.org/10.1007/978-3-642-68851-5
Michel Raynal, Jean-Michel Hélary • International Linear Collider
(1990)
Part 1 Different forms of synchronization between processes: distributed systems, networks, and networks of processes synchronization. Part 2 The concept of a wave, and synchronization by wave train: wave algorithms example of use - computa...
OPENALEX
Matt Blaze, Joan Feigenbaum, John Ioannidis, Angelos Dennis Keromytis • Lecture notes in computer science
(1999)
OPENALEX
DOI: https://doi.org/10.1007/3-540-48749-2_8
Hutchison, David, Demetri Terzopoulos, John C. Mitchell, Friedemann Mattern et al. • Lecture notes in computer science
(2008)
OPENALEX
DOI: https://doi.org/10.1007/978-3-540-92221-6
Anna Hác • ACM SIGMETRICS Performance Evaluation Review
(1989)
Most distributed systems are characterized by distribution of both physical and logical features. The architecture of a distributed system is usually modular. Most distributed systems support a varying number of processing elements. The sys...
OPENALEX
Open Access
DOI: https://doi.org/10.1145/1041911.1041912
Joseph A. Bannister, Kishor Shridharbhai Trivedi • Acta Informatica
(1983)
OPENALEX
DOI: https://doi.org/10.1007/bf01257086
Colin Atkinson, Antônio José Natali, T. Moreton • Cambridge University Press eBooks
(1988)
This book describes the difficulties involved in programming distributed systems in Ada and outlines the various possible approaches. In then describes in detail the technique developed in the GEC MAP (Multi-Annual Programme) project....
OPENALEX
Morris S. Sloman (1994)
Contents Introduction 1. Management - What and Why Enabling Technologies 2. Network Technologies 3. Distributed Systems Models and Standards for Management 4. OSI Management Model and Standards 5. OSI Structure of Management Information 6. ...
OPENALEX
Michael J. Butler, Marina Waldén • ePrints Soton (University of Southampton)
(1996)
The B-Method is a method for the stepwise derivation of sequential programs. In this paper we show how the B-Method can be used for designing distributed systems by embedding action systems within this method. The action system formalism is...
OPENALEX
Rachid Guerraoui, André Schiper • Lecture notes in computer science
(1996)
OPENALEX
Open Access
DOI: https://doi.org/10.1007/bfb0013477
Michael P. Polis, Raymond E. Goodson • Proceedings of the IEEE
(1976)
This paper surveys the distributed system parameter identification problem and concludes that it can be treated as a series of largely independent subproblems, each of which must be considered in any attempt to treat the problem in applicat...
OPENALEX
DOI: https://doi.org/10.1109/proc.1976.10066