Complexity of finding embeddings in a k-tree
SIAM Journal on Algebraic and Discrete Methods
Computers and Biomedical Research
Integrating parallelization strategies for linkage analysis
Computers and Biomedical Research
Bucket elimination: a unifying framework for probabilistic inference
Learning in graphical models
Processor Sharing Queueing Models of Mixed Scheduling Disciplines for Time Shared System
Journal of the ACM (JACM)
On the parallelization of Linkmap from the LINKAGE/FASTLINK package
Computers and Biomedical Research
Likelihood Computations Using Value Abstraction
UAI '00 Proceedings of the 16th Conference on Uncertainty in Artificial Intelligence
Adaptive Computing on the Grid Using AppLeS
IEEE Transactions on Parallel and Distributed Systems
High-performance implementation and analysis of the linkmap program
Computers and Biomedical Research
Scheduling From the Perspective of the Application
HPDC '96 Proceedings of the 5th IEEE International Symposium on High Performance Distributed Computing
HPDC '02 Proceedings of the 11th IEEE International Symposium on High Performance Distributed Computing
RUMR: Robust Scheduling for Divisible Workloads
HPDC '03 Proceedings of the 12th IEEE International Symposium on High Performance Distributed Computing
Journal of Parallel and Distributed Computing - High-performance computational biology
Scheduling divisible workloads on heterogeneous platforms
Parallel Computing - Parallel matrix algorithms and applications (PMAA '02)
Scheduling in the Grid application development software project
Grid resource management
Resource Management for Rapid Application Turnaround on Enterprise Desktop Grids
Proceedings of the 2004 ACM/IEEE conference on Supercomputing
Self adaptivity in Grid computing: Research Articles
Concurrency and Computation: Practice & Experience - Grid Performance
Costs and benefits of load sharing in the computational grid
JSSPP'04 Proceedings of the 10th international conference on Job Scheduling Strategies for Parallel Processing
| Hi-index | 0.00 |
Linkage analysis is a tool used by geneticists for mapping disease-susceptibility genes in the study of Mendelian and complex diseases. However analyses of large inbred pedigrees with extensive missing data are often beyond the capabilities of a single computer. We present a distributed system called SUPERLINK-ONLINE for computing multipoint LOD scores of large inbred pedigrees. It achieves high performance via efficient parallelization of the algorithms in SUPERLINK, a state-of-the-art serial program for these tasks, and through utilization of thousands of resources residing in multiple opportunistic grid environments. Notably, the system is available online, which allows computationally intensive analyses to be performed with no need for either installation of software, or maintenance of a complicated distributed environment. The main algorithmic challenges have been to efficiently split large tasks for distributed execution in a highly dynamic non-dedicated running environment, as well as to utilize resources in all the available grid environments. Meeting these challenges has provided nearly interactive response time for shorter tasks while simultaneously serving massively parallel ones. The system, which is being used extensively by medical centers worldwide, achieves speedups of up to three orders of magnitude and allows analyses that were previously infeasible.