Result: Global state detection based on peer-to-peer interactions

Title:
Global state detection based on peer-to-peer interactions
Authors:
CHANDRA, Punit, KSHEMKALYANI, Ajay D
Source:
Embedded and ubiquitous computing (International conference EUC 2005)0EUC 2005. :560-571
Publisher Information:
Berlin: Springer, 2005.
Publication Year:
2005
Physical Description:
print, 13 ref 1
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Logiciel, Software, Systèmes informatiques et systèmes répartis. Interface utilisateur, Computer systems and distributed systems. User interface, Algorithme réparti, Distributed algorithm, Algoritmo repartido, Calculateur embarqué, Boarded computer, Calculador embarque, Complexité algorithme, Algorithm complexity, Complejidad algoritmo, Informatique diffuse, Pervasive computing, Informática difusa, Poste à poste, Peer to peer, Par a par, Structure donnée, Data structure, Estructura datos, Système réparti, Distributed system, Sistema repartido
Document Type:
Conference Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Computer Science Department, Univ. of Illinois at Chicago, Chicago, IL 60607, United States
ISSN:
0302-9743
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=17372630
Rights:
Copyright 2006 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.17372630
Database:
PASCAL Archive

Further Information

This paper presents an algorithm for global state detection based on peer-to-peer interactions. The interactions in distributed systems can be analyzed in terms of the peer-to-peer pairwise interactions of intervals between processes. This paper examines the problem: If a global state of interest to an application is specified in terms of the pairwise interaction types between each pair of peer processes, how can such a global state be detected? Devising an efficient algorithm is a challenge because of the overhead of having to track the intervals at different processes. We devise a distributed on-line algorithm to efficiently manage the distributed data structures and solve this problem. We prove the correctness of the algorithm and analyze its complexity.