This paper has been accepted at the 9th International Conference on Distributed Computing and Networking, ICDCN 2008. This Work was done in collaboration with Dr. Scott Pike and Yantao Song.

Click here for the DOI.

Abstract: We present a wait-free solution to the generalized dining philosophers problem under eventual weak exclusion in environments subject to crash faults. Wait-free dining guarantees that every correct hungry process eventually eats, regardless of process crashes. Eventual weak exclusion (<>WX) actually allows scheduling mistakes, whereby mutual exclusion may be violated finitely-many times; for each run, however, there must exist a convergence point after which live neighbors never eat simultaneously.Wait-free dining under <>WX is particularly useful for synchronization tasks where eventual safety is sufficient for correctness (e.g., duty-cycle scheduling, self-stabilizing daemons, and contention managers). Unfortunately, wait-free dining is unsolvable in asynchronous systems. As such, we characterize sufficient conditions for solvability under partial synchrony by presenting a wait-free dining algorithm for <>WX using a local refinement of the eventually perfect failure detector <>P₁.

 The complete paper is here .

Stagecenter community theater in Bryan downtown is playing 'Cabin Fever - A Texas Tagicomedy'. I am playing the role of Micheal Cody in the play.

Directed by Deborah English
Written by Mark Dunn
Show Dates: Oct 4,5,6
11,12,13
18,19,20

Time: 7:30 PM
Curtain Call: 7:15 PM
Cast:

Aubery - Charles Pitman
Karen - Amy Ressler
Pidge - Nancy Woods
Georgine - Amber Maler
Cesca - Ashley Bertling
Aunt Tammy - Deborah English
Micheal - Srikanth Sastry


Tickets $10 Adults
$ 8 Students
$ 6 on Thursdays
 

All my shows on Touchstone Radio are now available for live listening here. Go to the `Volunteer Work' menu and click on 'Touchstone Radio'.

You can also subscribe to the podcasting rss feed. 

In December 2005, I visited Kudremukh (in India), the town I had spent most of my childhood, and all of my schooling years in. It was an extermely nostalgic experience, especially because the town is shuting down, and my visit may have been my last ever to Kudremukh.

I wrote a relatively long travelogue about my visit to Kudremukh. The travelogue is in six parts, and can be accessed via the Leisure Activities -> Travelouges  section in the left side menu. Click here to get to the first part.

This paper has been accepted at the Fifth International Symposium on Parallel and Distributed Applications and Processing (ISPA 2007) Aug 29-31 2007. This work was done in collaboration with Dr. Scott Pike .

Click here for the DOI .

Abstract: We present a novel implementation of the eventually perfect failure detector (<>P) from the original hierarchy of Chandra-Toueg oracles. Previous implementations of <>P have assumed models of partial synchrony where point-to-point message delay is bounded and/or communication is reliable. We show how to implement this important oracle under even weaker assumptions using Average Delayed/Dropped (ADD) channels. Briefly, all messages sent on an ADD channel are either privileged or non-privileged. All non-privileged messages can be arbitrarily delayed or even dropped. For each run, however, there exist some unknown window size w, and two unknown upper-bounds d and r, where d bounds the average delay of the last w privileged messages, and r bounds the ratio of non-privileged messages to privileged messages per window.

For the full text of the paper click here .