ACM SIGACT news distributed computing column 32: the year in review

  title={ACM SIGACT news distributed computing column 32: the year in review},
  author={Idit Keidar},
  journal={SIGACT News},
  • I. Keidar
  • Published 30 November 2008
  • Computer Science
  • SIGACT News
This column overviews the main events related to distributed computing in 2008. I begin with a citation of this year’s Dijkstra Prize in Distributed Computing, which was awarded (in PODC’08) to Baruch Awerbuch and David Peleg for their paper “Sparse Partitions” published in FOCS in 1990. I include a reprint of the award statement, provided by Gadi Taubenfeld, the head of this year’s award committee. I then proceed with reviews of PODC– the ACM Symposium on Principles of Distributed Computing… 
Association among independent and dependent factors of host in volunteer computing
This paper considered on characterization host's factors in concept of association between dependent and independent factors of hosts, and found that time zone and location have dependency, also processor's number have correlation with CPU interval availability while frequency number of CPU availability has correlation with RAM size.
Adaptive probabilistic Skip Graph
The existing algorithm for searching in skip graph has O(log n) time complexity which can be further decreased by using the proposed approach named as Adaptive Probabilistic Skip Graph (APSG).
P-Skip Graph: An Efficient Data Structure for Peer-to-Peer Network
A new data structure P-skip graph is proposed, a modified version of Skip graph, which reduces the search time of a hot spot node drastically from initial time of O(log n), demonstrating that the proposed approach can in fact effectively decrease the searchtime to O(1).
T Decreasing Response Time in Distributed Computing for SOA Based Applications
This article debates vital performance glitches in the design of SOA based application while it is deployed in distribute environment to take the benefits of distributed computing. There is major
Reactive Distributed System Modeling Supported by Complex Event Processing
  • J. Lang, Janusz Janik
  • Computer Science
    2013 3rd Eastern European Regional Conference on the Engineering of Computer Based Systems
  • 2013
This paper implemented a functional model of an electronic toll collection system, based on system specifications for Slovak conditions, and evaluated complex event processing impact on system's functionality, modifiability, performance and other characteristics.
ITRA under Partitions
This paper proposes an extension to ITRA that supports continuous availability under partitions in multi-tier environments using the collaboration of neighboring tiers and discusses a unique approach, discussed in this paper.
High-Level Executable Specifications of Distributed Algorithms
This paper describes a method for specifying complex distributed algorithms at a very high yet executable level, focusing in particular on general principles for making properties and invariants
Towards practical intrusion tolerant systems: a blueprint
The blueprint of a novel middleware infrastructure that can be used to build mission-critical systems with increased resiliency against intrusion attacks is presented.
Strategies for efficient parallel visualization
New techniques for the interactive analysis of time-dependent field and particle data are introduced, focusing both on the expressiveness of the visualization and on a structure allowing for efficient parallel computing, in a variety of generic strategies towards high-performance visualization.
Using Fingerprint Recognition in a New Security Model for Accessing Distributed Systems
The objective is to identify clear criteria which would enable robust comparison between FingerID and various similar applications available in the market, by focusing the theoretical background of the subject and an in-depth review of the literature available on various aspects of security provisions used in the industry for distributed systems.


Dynamo: amazon's highly available key-value store
D Dynamo is presented, a highly available key-value storage system that some of Amazon's core services use to provide an "always-on" experience and makes extensive use of object versioning and application-assisted conflict resolution in a manner that provides a novel interface for developers to use.
On implementing omega with weak reliability and synchrony assumptions
This work studies the feasibility and cost of implementing Ω---a fundamental failure detector at the core of many algorithms---in systems with weak reliability and synchrony assumptions, and gives an algorithm for Ω such that eventually only one process (the elected leader) sends messages.
Practical Byzantine fault tolerance
A new replication algorithm that is able to tolerate Byzantine faults that works in asynchronous environments like the Internet and incorporates several important optimizations that improve the response time of previous algorithms by more than an order of magnitude.
Probabilistic Quorum Systems
It is shown that this technique offers effective load reduction on servers and high availability, and bounds on the server load that can be achieved with these techniques are proved.
On the quality of service of failure detectors
This work proposes a set of QoS metrics to specify failure detectors for systems with probabilistic behaviors, i.e. for systems where message delays and message losses follow some probability distributions, and gives a new failure detector algorithm and analyze its QoS in terms of these metrics.
Probabilistic Quorum Systems. The Information and Computation Journal
  • Probabilistic Quorum Systems. The Information and Computation Journal
  • 2001