- Dynamic lightpath protection in survivable WDM networks requires finding a pair of diverse routes (i.e., a primary route and a backup route that are link-disjoint) that form a cy...
Vinh Trong Le, Son-Hong Ngo, Xiaohong Jiang, Susum...
In this paper we present an algorithm that can be used to implement sequential, causal, or cache consistency in distributed shared memory (DSM) systems. For this purpose it has a ...
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
It was open for more than eight years to obtain an algorithm for computing the convex hull of a set of n sorted points in sub-logarithmic time on a reconfigurable mesh of size pn ...
Though causal order of message delivery simplifies the design and development of distributed applications, the overhead of enforcing it is not negligible. Causal order algorithm w...
Ikhyeon Jang, Jaehyung Park, Jung Wan Cho, Hyunsoo...