[
Lists Home |
Date Index |
Thread Index
]
I came across this recent announcement [1] of a proposed protocol that
promises "faster Web services" - it's called "Order-based Deadlock
Prevention Protocol with Parallel Requests", developed by Jonghun Park,
a professor at Pennsylvania State University's School of Information
Sciences and Technology,
It appears to address the Web services parallel of the classic "deadly
embrace" OS scenario.
Although the paper proposing this concept (to be titled "A Scalable
Protocol for Deadlock and Livelock Free Co-Allocation of Resources in
Internet Computing,") has yet been released, the article states:
- This protocol "is based on an algorithm that lets it use parallel
instead of serial methods to process requests. Such a method boosts the
efficiency of how resources are shared over the Internet. "
- Two problems "likely to become even bigger hindrances as Web services
and Internet collaborative computing become widespread are livelock and
deadlock. Livelock occurs when two or more processes keep shifting
their requests in response to the changes occurring in the other--with
neither process succeeding in carrying out any productive work. Deadlock
occurs when two or more processes get bogged down waiting for the other
to make a move. In other words, instead of concurrent applications
collaborating, they will vie for resources or just freeze while waiting
for the other to take a lead."
- Park's research was presented last week at the Institute of Electrical
and Electronics Engineers' Symposium on Applications and the Internet in
Orlando, Fla.
I would be very interested in learning of any thoughts or impressions on
this concept.
Thanks,
Joe Chiusano
Booz | Allen | Hamilton
[1] http://news.com.com/2100-1001-982905.html
begin:vcard
n:Chiusano;Joseph
tel;work:(703) 902-6923
x-mozilla-html:FALSE
url:www.bah.com
org:Booz | Allen | Hamilton;IT Digital Strategies Team
adr:;;8283 Greensboro Drive;McLean;VA;22012;
version:2.1
email;internet:chiusano_joseph@bah.com
title:Senior Consultant
fn:Joseph M. Chiusano
end:vcard
|
