Skip to Main Content
 

Global Search Box

 
 
 
 

ETD Abstract Container

Abstract Header

SELF-STABILIZING PHILOSOPHERS WITH GENERIC CONFLICTS

Danturi, Praveen Kumar

Abstract Details

2007, MS, Kent State University, College of Arts and Sciences / Department of Computer Science.
We generalize the classic dining philosophers problem to separate the conflict and communication neighbors of each process. Communication neighbors may directly exchange information while conflict neighbors compete for the access to the exclusive critical section of code. This generalization is motivated by a number of practical problems in distributed systems. We present a self-stabilizing deterministic algorithm KDP that solves a restricted version of the generalized problem where the conflict set for each process is limited to its k-hop neighborhood. We formally prove KDP correct and evaluate its performance. We then extend KDP to handle fully generalized problem. We further extend it to handle a similarly generalized drinking philosophers problem. We describe how KDP can be implemented in wireless sensor networks and demonstrate that this implementation does not jeopardize its correctness or termination properties.
Mikhail Nesterenko (Advisor)

Recommended Citations

Citations

  • Danturi, P. K. (2007). SELF-STABILIZING PHILOSOPHERS WITH GENERIC CONFLICTS [Master's thesis, Kent State University]. OhioLINK Electronic Theses and Dissertations Center. http://rave.ohiolink.edu/etdc/view?acc_num=kent1175661684

    APA Style (7th edition)

  • Danturi, Praveen. SELF-STABILIZING PHILOSOPHERS WITH GENERIC CONFLICTS. 2007. Kent State University, Master's thesis. OhioLINK Electronic Theses and Dissertations Center, http://rave.ohiolink.edu/etdc/view?acc_num=kent1175661684.

    MLA Style (8th edition)

  • Danturi, Praveen. "SELF-STABILIZING PHILOSOPHERS WITH GENERIC CONFLICTS." Master's thesis, Kent State University, 2007. http://rave.ohiolink.edu/etdc/view?acc_num=kent1175661684

    Chicago Manual of Style (17th edition)