Titlebook: Distributed Computing; 23rd International S Idit Keidar Conference proceedings 2009 Springer-Verlag Berlin Heidelberg 2009 Routing.algorith

愛國者

不規(guī)則的跳動

不能和解

最有利

Contention-Sensitive Data Structures and Algorithms a contention-sensitive consensus algorithm, a contention-sensitive double-ended queue data structure, and a contention-sensitive election algorithm. Finally, we generalize the result to enable to avoid locking also when contention is low.

先鋒派

一再遛

Conference proceedings 2009mber 2009. The 33 revised full papers, selected from 121 submissions, are presented together with 15 brief announcements of ongoing works; all of them were carefully reviewed and selected for inclusion in the book. The papers address all aspects of distributed computing, and were organized in topica

Amplify

guzzle

The 2009 Edsger W. Dijkstra Prize in Distributed ComputingThe Edsger W. Dijkstra Prize in Distributed Computing is awarded for an outstanding paper on the principles of distributed computing, whose significance and impact on the theory and/or practice of distributed computing has been evident for at least a decade.

蚊帳

爭吵加

978-3-642-04354-3Springer-Verlag Berlin Heidelberg 2009