Sciweavers

2303 search results - page 24 / 461
» Interior-Point Methods in Parallel Computation
Sort
View
CONCUR
1991
Springer
13 years 11 months ago
A Method for the Development of Totally Correct Shared-State Parallel Programs
Abstract. A syntax-directed formal system for the development of totally correct programs with respect to an (unfair) shared-state parallel programming language is proposed. The pr...
Ketil Stølen
GPC
2008
Springer
13 years 8 months ago
Using Moldability to Improve Scheduling Performance of Parallel Jobs on Computational Grid
In a computational grid environment, a common practice is try to allocate an entire parallel job onto a single participating site. Sometimes a parallel job, upon its submission, ca...
Kuo-Chan Huang, Po-Chi Shih, Yeh-Ching Chung
CAP
2010
13 years 2 months ago
Parallel disk-based computation for large, monolithic binary decision diagrams
Binary Decision Diagrams (BDDs) are widely used in formal verification. They are also widely known for consuming large amounts of memory. For larger problems, a BDD computation wi...
Daniel Kunkle, Vlad Slavici, Gene Cooperman
ICCS
2005
Springer
14 years 1 months ago
Generating Parallel Algorithms for Cluster and Grid Computing
We revisit and use the dependence transformation method to generate parallel algorithms suitable for cluster and grid computing. We illustrate this method in two applications: to o...
Ulisses Kendi Hayashida, Kunio Okuda, Jairo Panett...
ICDM
2009
IEEE
172views Data Mining» more  ICDM 2009»
14 years 2 months ago
Sparse Least-Squares Methods in the Parallel Machine Learning (PML) Framework
—We describe parallel methods for solving large-scale, high-dimensional, sparse least-squares problems that arise in machine learning applications such as document classificatio...
Ramesh Natarajan, Vikas Sindhwani, Shirish Tatikon...