Parallel arc-allocation algorithms for optimizing generalized networks
نویسندگان
چکیده
منابع مشابه
Parallel Algorithms for Hypercube Allocation
Parallel algorithms of the hypercube allocation strategies are considered in this paper. Although the sequential algorithms of various hypercube allocation strategies are easier to implement, their worst case time complexities exponentially increase as the dimension of the hypercube increases. We show that the free processors can be utilized t o perform the allocation jobs in parallel to improv...
متن کاملParallel Genetic Algorithms for Optimizing Morphological
In this paper several design methods for parallel genetic algorithms (PGAs) optimizing morphological lters are discussed and an optimal scale and machine independent PGA for a loosely coupled, homogeneous or inhomogeneous multiprocessor computer is developed. The optimization is made in terms of computation speed, parallelization eeciency and quality. Quality means, in this context, the tness o...
متن کاملHarpLDA+: Optimizing latent dirichlet allocation for parallel efficiency
Latent Dirichlet Allocation (LDA) is a widely used machine learning technique in topic modeling and data analysis. Training large LDA models on big datasets involves dynamic and irregular computation patterns and is a major challenge to both algorithm optimization and system design. In this paper, we present a comprehensive benchmarking of our novel synchronized LDA training system HarpLDA+ bas...
متن کاملOptimizing process allocation of parallel programs for heterogeneous clusters
The performance of a conventional parallel application is often degraded by load-imbalance on heterogeneous clusters. Though it is simple to invoke multiple processes on fast PEs to alleviate loadimbalance, the optimal process allocation is not obvious. Kishimoto and Ichikawa presented performance models for HPL (High Performance Linpack), with which the sub-optimal configurations of heterogene...
متن کاملProvable algorithms for parallel generalized sweep scheduling
We present provably efficient parallel algorithms for sweep scheduling, which is a commonly used technique in Radiation Transport problems, and involves inverting an operator by iteratively sweeping across a mesh from multiple directions. Each sweep involves solving the operator locally at each cell. However, each direction induces a partial order in which this computation can proceed. On a dis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Operations Research
سال: 1990
ISSN: 0254-5330,1572-9338
DOI: 10.1007/bf02023051