scholarly journals Comparison of High Performance Parallel Implementations of TLBO and Jaya Optimization Methods on Manycore GPU

IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 133822-133831
Author(s):  
H. Rico-Garcia ◽  
Jose-Luis Sanchez-Romero ◽  
A. Jimeno-Morenilla ◽  
H. Migallon-Gomis ◽  
H. Mora-Mora ◽  
...  
Author(s):  
Indar Sugiarto ◽  
Doddy Prayogo ◽  
Henry Palit ◽  
Felix Pasila ◽  
Resmana Lim ◽  
...  

This paper describes a prototype of a computing platform dedicated to artificial intelligence explorations. The platform, dubbed as PakCarik, is essentially a high throughput computing platform with GPU (graphics processing units) acceleration. PakCarik is an Indonesian acronym for Platform Komputasi Cerdas Ramah Industri Kreatif, which can be translated as “Creative Industry friendly Intelligence Computing Platform”. This platform aims to provide complete development and production environment for AI-based projects, especially to those that rely on machine learning and multiobjective optimization paradigms. The method for constructing PakCarik was based on a computer hardware assembling technique that uses commercial off-the-shelf hardware and was tested on several AI-related application scenarios. The testing methods in this experiment include: high-performance lapack (HPL) benchmarking, message passing interface (MPI) benchmarking, and TensorFlow (TF) benchmarking. From the experiment, the authors can observe that PakCarik's performance is quite similar to the commonly used cloud computing services such as Google Compute Engine and Amazon EC2, even though falls a bit behind the dedicated AI platform such as Nvidia DGX-1 used in the benchmarking experiment. Its maximum computing performance was measured at 326 Gflops. The authors conclude that PakCarik is ready to be deployed in real-world applications and it can be made even more powerful by adding more GPU cards in it.


Author(s):  
Mehdi Modarressi ◽  
Hamid Sarbazi-Azad

In this chapter, we present a reconfigurable architecture for network-on-chips (NoC) on which arbitrary application-specific topologies can be implemented. The proposed NoC can dynamically tailor its topology to the traffic pattern of different applications, aiming to address one of the main drawbacks of existing application-specific NoC optimization methods, i.e. optimizing NoCs based on the traffic pattern of a single application. Supporting multiple applications is a critical feature of an NoC as several different applications are integrated into the modern and complex multi-core system-on-chips and chip multiprocessors and an NoC that is designed to run exactly one application does not necessarily meet the design constraints of other applications. The proposed NoC supports multiple applications by configuring as a topology which matches the traffic pattern of the currently running application in the best way. In this chapter, we first introduce the proposed reconfigurable topology and then address the two problems of core to network mapping and topology exploration. Experimental results show that this architecture effectively improves the performance of NoCs and reduces power consumption.


SIMULATION ◽  
2020 ◽  
Vol 96 (10) ◽  
pp. 791-806
Author(s):  
Milad Yousefi ◽  
Moslem Yousefi ◽  
Flavio S Fogliatto

Since high performance is essential to the functioning of emergency departments (EDs), they must constantly pursue sensible and empirically testable improvements. In light of recent advances in computer science, an increasing number of simulation-based approaches for studying and implementing ED performance optimizations have become available in the literature. This paper aims to offer a survey of these works, presenting progress made on the topic while indicating possible pitfalls and difficulties in EDs. With that in mind, this review considers research studies reporting simulation-based optimization experiments published between 2007 and 2019, covering 38 studies. This paper provides bibliographic background on issues covered, generates statistics on methods and tools applied, and indicates major trends in the field of simulation-based optimization. This review contributes to the state of the art on ED modeling by offering an updated picture of the present state of the field, as well as promising research gaps. In general, this review argues that future studies should focus on increasing the efficiency of multi-objective optimization problems by decreasing their cost in time and labor.


2010 ◽  
Vol 16 (1) ◽  
pp. 95-101 ◽  
Author(s):  
Dmitrij Šešok ◽  
Jonas Mockus ◽  
Rimantas Belevičius ◽  
Arnas Kačeniauskas

The aim is to investigate ways of increasing the efficiency of grillage optimization. Following this general aim, two well‐known optimization methods, namely the Genetic Algorithm (GA) and Simulated Annealing (SA), were compared using some standard medium size (10 and 15 piles) examples. The objective function was the maximal vertical reactive force at a support. Coordinates of piles were optimization variables. SA wins and was applied to real‐life problem (55 piles) by parallel computations performed using a powerful cluster. New element is comparison of SA with GA and application of SA to a practical problem of grillage optimization. Santrauka Straipsnio tikslas - ištirti galimus rostverkiniu pamatu optimizavimo būdus. Siekiant šio tikslo du gerai žinomi optimizavimo metodai ‐ genetiniai algoritmai ir atkaitinimo modeliavimo algoritmas ‐ buvo palyginti vidutinio dydžio (10 ir 15 poliu) pavyzdžiams išspresti. Tikslo funkcija imama didžiausia atraminI poliaus reakcija. Projektavimo kintamieji ‐ poliu koordinatIs. Atkaitinimo modeliavimo metodas laimi, todel jis buvo pritaikytas praktiniam uždaviniui (55 poliai) spresti. Spresti buvo naudojamas klasteris. Naujumas ‐ genetiniu algoritmu palyginimas su atkaitinimo modeliavimo metodu bei atkaitinimo modeliavimo metodo pritaikymas sprendžiant praktini uždavini.


Author(s):  
Julian Girardeau ◽  
Frederic Pardo ◽  
Jérôme Pailhès ◽  
Jean-Pierre Nadeau

The authors would like to address improvements on cooling system optimization within a turboshaft Nozzle Guide Vane (NGV). Designing high performance cooling systems able to preserve the life duration of the NGV can lead to significant aerodynamic losses. Theses losses jeopardize the performance of the whole engine. In the same time, a low efficiency cooling system may affect engine Maintenance Repair and Overhaul (MRO) costs as component life decreases. To help turbine designers, the authors studied a vane and searched for an optimal cooling design by means of an evolutionary algorithm. The associated objective function is based on satisfaction indexes, using Harrington’s desirability curves and Antonsson’s aggregation functions. Evaluation and optimization methods will be presented as well as optimized designs.


Author(s):  
Senthil Krishnamurthy ◽  
Raynitchka Tzoneva

<p>Multi-area Combined Economic Emission Dispatch (MACEED) problem is an optimization task in power system operation for allocating the amount of generation to the committed units within the system areas. Its objective is to minimize the fuel cost and the quantity of emissions subject to the power balance, generator limits, transmission line and tie-line constraints. The solutions of the MACEED problem in the conditions of deregulation are difficult, due to the model size, nonlinearities, and the big number of interconnections, and require intensive computations in real-time. High-Performance Computing (HPC) gives possibilities for the reduction of the problem complexity and the time for calculation by the use of parallel processing techniques for running advanced application programs efficiently, reliably and quickly. These applications are considered as very new in the power system control centers because there are not available optimization methods and software based on them that can solve the MACEED problem in parallel, paying attention to the existence of the power system areas and the tie-lines between them. A decomposition-coordinating method based on Lagrange’s function is developed in this paper. Investigations of the performance of the method are done using IEEE benchmark power system models.</p>


Author(s):  
Ibrahim Sobhi ◽  
Abdelmadjid Dobbi ◽  
Oussama Hachana

AbstractThe rate of penetration (ROP) optimization is one of the most important factors in improving drilling efficiency, especially in the downturn time of oil prices. This process is crucial in the well planning and exploration phases, where the selection of the drilling bits and parameters has a significant impact on the total cost and time of the drilling operation. Thus, the optimization and best selection of the drilling parameters are critical. Optimization of ROP is difficult due to the complexity of the relationship between the drilling variables and the ROP. For this reason, the development of high-performance computer systems, predictive models, and algorithms will be the best solution. In this study, a new investigation approach for ROP optimization has been done regarding different ROP models (Maurer, Bingham, Bourgoyne and Young models), algorithms (Multiple regression, ant colony optimization (ACO), fminunc, fminsearch, fsolve, lsqcurvefit, lsqnonlin), and different objective functions. The well-known data from the Louisiana field in an offshore well have been used to compare the used parameter estimation approach with other techniques. Indeed, datasets from an onshore well in the Hassi Messaoud Algerian field are explored. The results confirmed the superiority and the effectiveness of B&Y models compared to Bingham and Maurer models. Fminsearch, lsqcurvefit, ACO, and Excel (GRG) algorithms give the best results in ROP prediction while the application of the MNLR approach. Using the mean squared error (MSE) and the determination coefficient (R$$^{2}$$ 2 ) as objective functions significantly increases the accuracy prediction where the results given are ($$R=0.9522$$ R = 0.9522 , $$RMSE=2.85$$ R M S E = 2.85 ) and ($$R= 0.9811$$ R = 0.9811 , $$RMSE=4.08$$ R M S E = 4.08 ) for Wells 1 and 2, respectively. This study validates the application of B&Y model in both onshore and offshore wells. The findings reveal to deal with data limitation problems in ROP prediction. Simple and effective optimization techniques that require less memory space and computational time have been provided.


2019 ◽  
Vol 34 (4) ◽  
pp. 215-223 ◽  
Author(s):  
Ivan Sosnovik ◽  
Ivan Oseledets

Abstract In this research, we propose a deep learning based approach for speeding up the topology optimization methods. The problem we seek to solve is the layout problem. The main novelty of this work is to state the problem as an image segmentation task. We leverage the power of deep learning methods as the efficient pixel-wise image labeling technique to perform the topology optimization. We introduce convolutional encoder-decoder architecture and the overall approach of solving the above-described problem with high performance. The conducted experiments demonstrate the significant acceleration of the optimization process. The proposed approach has excellent generalization properties. We demonstrate the ability of the application of the proposed model to other problems. The successful results, as well as the drawbacks of the current method, are discussed.


1995 ◽  
Vol 34 (2) ◽  
pp. 263-272 ◽  
Author(s):  
R. C. Agarwal ◽  
B. Alpern ◽  
L. Carter ◽  
F. G. Gustavson ◽  
D. J. Klepacki ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document