Sciweavers

1075 search results - page 133 / 215
» Comparison of Genomes Using High-Performance Parallel Comput...
Sort
View
HPDC
2005
IEEE
14 years 2 months ago
Automatic dynamic run-time optical network reservations
Optical networking may dramatically change high performance distributed computing. One reason is that optical networks can support provisioning dynamically configurable lightpath...
John R. Lange, Ananth I. Sundararaj, Peter A. Dind...
IPPS
1999
IEEE
14 years 1 months ago
Implementation of a Virtual Time Synchronizer for Distributed Databases
The availability of high speed networks and improved microprocessor performance have made it possible to build inexpensive cluster of workstations as an appealing platform for par...
Azzedine Boukerche, Sajal K. Das, Ajoy Kumar Datta...
SPAA
1998
ACM
14 years 1 months ago
Elimination Forest Guided 2D Sparse LU Factorization
Sparse LU factorization with partial pivoting is important for many scienti c applications and delivering high performance for this problem is di cult on distributed memory machin...
Kai Shen, Xiangmin Jiao, Tao Yang
EUROPAR
2006
Springer
14 years 18 days ago
Early Experiences with KTAU on the IBM BG/L
Abstract. The influences of OS and system-specific effects on application performance are increasingly important in high performance computing. In this regard, OS kernel measuremen...
Aroon Nataraj, Allen D. Malony, Alan Morris, Samee...
BMCBI
2002
131views more  BMCBI 2002»
13 years 8 months ago
Efficient Boolean implementation of universal sequence maps (bUSM)
Background: Recently, Almeida and Vinga offered a new approach for the representation of arbitrary discrete sequences, referred to as Universal Sequence Maps (USM), and discussed ...
John Schwacke, Jonas S. Almeida