A Penn State researcher has developed a faster method for more efficient sharing of widely distributed Internet resources such as Web services, databases and high performance computers.

The research paper, "A Scalable Protocol for Deadlock and Livelock Free Co-Allocation of Resources in Internet Computing" was published at IEEE's Symposium on Applications and the Internet in Orlando, Fla.

The proposed algorithm enables better coordination of Internet applications in support of large-scale computing. The protocol uses parallel rather than serial methods to process requests. That helps with more efficient resource allocation as well as solves the problems of deadlock and livelock caused by multiple concurrent Internet applications competing for Internet resources.

Comments


Log in to comment or register here.


Who voted for this story