Reset
Showing 20 of 13,979 academic articles

Symmetry and similarity in distributed systems

Ralph E. Johnson, Fred B. Schneider • ACM Symposium on Principles of Distributed Computing (PODC) (1985)

Abstract: Similarity is introduced as a model-independent characterization of symmetry. It can be used to decide when a concurrent system has a solution to the selection problem. It can also be used to compare different models of parallel c...

OPENALEX DOI: https://doi.org/10.1145/323596.323598

Distributed System Design with Message Sequence Charts

Ingolf H. Krüger • mediaTUM – the media and publications repository of the Technical University Munich (Technical University Munich) (2000)

The methodical mastery of interaction scenarios is a key factor for capturing and modeling system requirements of distributed, reactive systems. Message Sequence Charts (MSCs) and variants thereof are well-accepted as a graphical descriptio...

OPENALEX Open Access

The Verification of a Distributed System

Caitie McCaffrey • Queue (2015)

Leslie Lamport, known for his seminal work in distributed systems, famously said, "A distributed system is one in which the failure of a computer you didn’t even know existed can render your own computer unusable." Given this bleak outlook ...

OPENALEX Open Access DOI: https://doi.org/10.1145/2857274.2889274

Functionally Accurate, Cooperative Distributed Systems

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

Distributed Systems

Jared Dean • Wiley eBooks (2014)

Distributed systems have become a central part of big data. The systems are part of two subgroups: distributed databases such as Teradata or distributed file systems like Hadoop. Breakthroughs in technology have reduced costs in computing a...

OPENALEX DOI: https://doi.org/10.1002/9781118691786.ch2

Parallel Spectral Clustering in Distributed Systems

Wen-Yen Chen, Yangqiu Song, Hongjie Bai, Chih‐Jen Lin et al. • IEEE Transactions on Pattern Analysis and Machine Intelligence (2010)

Spectral clustering algorithms have been shown to be more effective in finding clusters than some traditional algorithms, such as k-means. However, spectral clustering suffers from a scalability problem in both memory use and computational ...

OPENALEX DOI: https://doi.org/10.1109/tpami.2010.88

About logical clocks for distributed systems

Michel Raynal • ACM SIGOPS Operating Systems Review (1992)

Memory space and processor time are basic resources when executing a program. But beside this implementation aspect (this time resource is necessary but does not belong to the program semantics), the concept of time presents a more fundamen...

OPENALEX Open Access DOI: https://doi.org/10.1145/130704.130708

Dynamic Thermal Management for Distributed Systems

Andreas Weißel, Frank Bellosa • Repository KITopen (Karlsruhe Institute of Technology) (2004)

In modern data centers, the impact on the thermal properties by increased scale and power densities is enormous and poses new challenges on the designers of both computing as well as cooling systems. Controltheoretic techniques have proven ...

OPENALEX Open Access DOI: https://doi.org/10.5445/ir/1000002572

On Deadlock Detection in Distributed Systems

Virgil D. Gligor, S.H. Shattuck • IEEE Transactions on Software Engineering (1980)

A hierarchically organized and a distributed protocol for deadlock detection in distributed databases are presented in [1]. In this paper we show that the distributed protocol is incorrect, and present possible remedies. However, the distri...

OPENALEX DOI: https://doi.org/10.1109/tse.1980.230491