Given the pairwise affinity relations associated with a set of data items, the goal of a clustering algorithm is to automatically partition the data into a small number of homogen...
In this paper we analyze the I/O access patterns of a widely-used biological sequence search tool and implement two variations that employ parallel-I/O for data access based on PV...
Yifeng Zhu, Hong Jiang, Xiao Qin, David R. Swanson
Abstract. Agent-based simulation of large multicellular biological systems has become a viable option owing to affordable parallel computers, such as Beowulf-style clusters. We de...
Toh Da-Jun, Francis Tang, Travis Lee, Deepak Sarda...
This paper describes the evolution of the Portals message passing architecture and programming interface from its initial development on tightly-coupled massively parallel platfor...
Ron Brightwell, William Lawry, Arthur B. Maccabe, ...
We present a new parallel algorithm that extends and generalizes the traditional graph analysis metric of betweenness centrality to include additional non-shortest paths according...