Conference paper
Optimization algorithms for energy-efficient data centers
Hendrik F. Hamann
InterPACK 2013
We present a parallel algorithm which uses n2 processors to find the connected components of an undirected graph with n vertices in time O(log2n). An O(log2n) time bound also can be achieved using only n⌈n/⌈log2n⌉⌉ processors. The algorithm can be used to find the transitive closure of a symmetric Boolean matrix. We assume that the processors have access to a common memory. Simultaneous access to the same location is permitted for fetch instructions but not for store instructions. © 1979, ACM. All rights reserved.
Hendrik F. Hamann
InterPACK 2013
Thomas R. Puzak, A. Hartstein, et al.
CF 2007
Sabine Deligne, Ellen Eide, et al.
INTERSPEECH - Eurospeech 2001
N.K. Ratha, A.K. Jain, et al.
Workshop CAMP 2000