Back to results

University of Nevada, Las Vegas

Asynchronous neighborhood task synchronization

Abstract

dc:description.abstract

Faults are likely to occur in distributed systems. The motivation for designing self-stabilizing system is to be able to automatically recover from a faulty state. As per Dijkstra's definition, a system is self-stabilizing if it converges to a desired state from an arbitrary state in a finite number of steps. The paradigm of self-stabilization is considered to be the most unified approach to designing fault-tolerant systems. Any type of faults, e.g., transient, process crashes and restart, link failures and recoveries, and byzantine faults, can be handled by a self-stabilizing system; Many applications in distributed systems involve multiple phases. Solving these applications require some degree of synchronization of phases. In this thesis research, we introduce a new problem, called asynchronous neighborhood task synchronization ( NTS ). In this problem, processes execute infinite instances of tasks, where a task consists of a set of steps. There are several requirements for this problem. Simultaneous execution of steps by the neighbors is allowed only if the steps are different. Every neighborhood is synchronized in the sense that all neighboring processes execute the same instance of a task. Although the NTS problem is applicable in nonfaulty environments, it is more challenging to solve this problem considering various types of faults. In this research, we will present a self-stabilizing solution to the NTS problem. The proposed solution is space optimal, fault containing, fully localized, and fully distributed. One of the most desirable properties of our algorithm is that it works under any (including unfair) daemon. We will discuss various applications of the NTS problem.

Degree

thesis:*
Name thesis:degree_name
Master of Science (MS)
Level thesis:degree_level
Thesis
Discipline thesis:degree_discipline
Computer Science
Grantor dc:publisher
University of Nevada, Las Vegas
Year
2004

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Kamaraju, Supriya
Contributors dc:contributor
  • Ajoy Kumar Datta
  • Maria Gradinariu

Rights

dc:rights
Statement dc:rights
  • IN COPYRIGHT. For more information about this rights statement, please visit http://rightsstatements.org/vocab/InC/1.0/
Language dc:language
English

Identifiers

dc:identifier.*
OAI identifier oai:identifier
oai:oasis.library.unlv.edu:rtds-2665

Chain of custody

source
Harvested from
University of Nevada - Las Vegas
Base URL
oasis.library.unlv.edu/do/oai/
Last updated
2026-07-24
Source record
OAI-PMH GetRecord
related terms
citation

Kamaraju, Supriya. Asynchronous neighborhood task synchronization. Thesis thesis, University of Nevada, Las Vegas, 2004. https://doi.org/10.25669/n3lw-7lgu