Asynchronous Global Optimization for Massive-scale Computing
نویسنده
چکیده
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . xii
منابع مشابه
A Robust Asynchronous Newton Method for Massive Scale Computing Systems
Volunteer computing grids offer supercomputing levels of computing power at the relatively low cost of operating a server. In previous work, the authors have shown that it is possible to take traditionally iterative evolutionary algorithms and execute them on volunteer computing grids by performing them asynchronously. The asynchronous implementations dramatically increase scalability and decre...
متن کاملEfficient Data Mining with Evolutionary Algorithms for Cloud Computing Application
With the rapid development of the internet, the amount of information and data which are produced, are extremely massive. Hence, client will be confused with huge amount of data, and it is difficult to understand which ones are useful. Data mining can overcome this problem. While data mining is using on cloud computing, it is reducing time of processing, energy usage and costs. As the speed of ...
متن کاملAsynchronous Stochastic Variational Inference
Stochastic variational inference (SVI) employs stochastic optimization to scale up Bayesian computation to massive data. Since SVI is at its core a stochastic gradient-based algorithm, horizontal parallelism can be harnessed to allow larger scale inference. We propose a lock-free parallel implementation for SVI which allows distributed computations over multiple slaves in an asynchronous style....
متن کاملGPU-Based Asynchronous Global Optimization with Particle Swarm
The recent upsurge in research into general-purpose applications for graphics processing units (GPUs) has made low cost high-performance computing increasingly more accessible. Many global optimization algorithms that have previously benefited from parallel computation are now poised to take advantage of general-purpose GPU computing as well. In this paper, a global parallel asynchronous partic...
متن کاملAsynchronous Organizations for Solving the Point-to-Point Connection Problem
We present an agent approach to solve the nonfixed point-to-point connection problem. The optimization version of this problem is NP-hard and has numerous applications in circuit switching and VLSI design. We use Asynchronous Teams (or A-Teams) technique to search for an optimal global solution. An A-Team is an organization of agents that communicate with each other by means of shared memories....
متن کامل