CINXE.COM
Search results for: Parallel Processors
<!DOCTYPE html> <html lang="en" dir="ltr"> <head> <!-- Google tag (gtag.js) --> <script async src="https://www.googletagmanager.com/gtag/js?id=G-P63WKM1TM1"></script> <script> window.dataLayer = window.dataLayer || []; function gtag(){dataLayer.push(arguments);} gtag('js', new Date()); gtag('config', 'G-P63WKM1TM1'); </script> <!-- Yandex.Metrika counter --> <script type="text/javascript" > (function(m,e,t,r,i,k,a){m[i]=m[i]||function(){(m[i].a=m[i].a||[]).push(arguments)}; m[i].l=1*new Date(); for (var j = 0; j < document.scripts.length; j++) {if (document.scripts[j].src === r) { return; }} k=e.createElement(t),a=e.getElementsByTagName(t)[0],k.async=1,k.src=r,a.parentNode.insertBefore(k,a)}) (window, document, "script", "https://mc.yandex.ru/metrika/tag.js", "ym"); ym(55165297, "init", { clickmap:false, trackLinks:true, accurateTrackBounce:true, webvisor:false }); </script> <noscript><div><img src="https://mc.yandex.ru/watch/55165297" style="position:absolute; left:-9999px;" alt="" /></div></noscript> <!-- /Yandex.Metrika counter --> <!-- Matomo --> <!-- End Matomo Code --> <title>Search results for: Parallel Processors</title> <meta name="description" content="Search results for: Parallel Processors"> <meta name="keywords" content="Parallel Processors"> <meta name="viewport" content="width=device-width, initial-scale=1, minimum-scale=1, maximum-scale=1, user-scalable=no"> <meta charset="utf-8"> <link href="https://cdn.waset.org/favicon.ico" type="image/x-icon" rel="shortcut icon"> <link href="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/css/bootstrap.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/plugins/fontawesome/css/all.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/css/site.css?v=150220211555" rel="stylesheet"> </head> <body> <header> <div class="container"> <nav class="navbar navbar-expand-lg navbar-light"> <a class="navbar-brand" href="https://waset.org"> <img src="https://cdn.waset.org/static/images/wasetc.png" alt="Open Science Research Excellence" title="Open Science Research Excellence" /> </a> <button class="d-block d-lg-none navbar-toggler ml-auto" type="button" data-toggle="collapse" data-target="#navbarMenu" aria-controls="navbarMenu" aria-expanded="false" aria-label="Toggle navigation"> <span class="navbar-toggler-icon"></span> </button> <div class="w-100"> <div class="d-none d-lg-flex flex-row-reverse"> <form method="get" action="https://waset.org/search" class="form-inline my-2 my-lg-0"> <input class="form-control mr-sm-2" type="search" placeholder="Search Conferences" value="Parallel Processors" name="q" aria-label="Search"> <button class="btn btn-light my-2 my-sm-0" type="submit"><i class="fas fa-search"></i></button> </form> </div> <div class="collapse navbar-collapse mt-1" id="navbarMenu"> <ul class="navbar-nav ml-auto align-items-center" id="mainNavMenu"> <li class="nav-item"> <a class="nav-link" href="https://waset.org/conferences" title="Conferences in 2024/2025/2026">Conferences</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/disciplines" title="Disciplines">Disciplines</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/committees" rel="nofollow">Committees</a> </li> <li class="nav-item dropdown"> <a class="nav-link dropdown-toggle" href="#" id="navbarDropdownPublications" role="button" data-toggle="dropdown" aria-haspopup="true" aria-expanded="false"> Publications </a> <div class="dropdown-menu" aria-labelledby="navbarDropdownPublications"> <a class="dropdown-item" href="https://publications.waset.org/abstracts">Abstracts</a> <a class="dropdown-item" href="https://publications.waset.org">Periodicals</a> <a class="dropdown-item" href="https://publications.waset.org/archive">Archive</a> </div> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/page/support" title="Support">Support</a> </li> </ul> </div> </div> </nav> </div> </header> <main> <div class="container mt-4"> <div class="row"> <div class="col-md-9 mx-auto"> <form method="get" action="https://publications.waset.org/abstracts/search"> <div id="custom-search-input"> <div class="input-group"> <i class="fas fa-search"></i> <input type="text" class="search-query" name="q" placeholder="Author, Title, Abstract, Keywords" value="Parallel Processors"> <input type="submit" class="btn_search" value="Search"> </div> </div> </form> </div> </div> <div class="row mt-3"> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Commenced</strong> in January 2007</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Frequency:</strong> Monthly</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Edition:</strong> International</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Paper Count:</strong> 1269</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: Parallel Processors</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1269</span> Parallel Vector Processing Using Multi Level Orbital DATA</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Nagi%20Mekhiel">Nagi Mekhiel</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Many applications use vector operations by applying single instruction to multiple data that map to different locations in conventional memory. Transferring data from memory is limited by access latency and bandwidth affecting the performance gain of vector processing. We present a memory system that makes all of its content available to processors in time so that processors need not to access the memory, we force each location to be available to all processors at a specific time. The data move in different orbits to become available to other processors in higher orbits at different time. We use this memory to apply parallel vector operations to data streams at first orbit level. Data processed in the first level move to upper orbit one data element at a time, allowing a processor in that orbit to apply another vector operation to deal with serial code limitations inherited in all parallel applications and interleaved it with lower level vector operations. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Memory%20Organization" title="Memory Organization">Memory Organization</a>, <a href="https://publications.waset.org/abstracts/search?q=Parallel%20Processors" title=" Parallel Processors"> Parallel Processors</a>, <a href="https://publications.waset.org/abstracts/search?q=Serial%0D%0ACode" title=" Serial Code"> Serial Code</a>, <a href="https://publications.waset.org/abstracts/search?q=Vector%20Processing" title=" Vector Processing"> Vector Processing</a> </p> <a href="https://publications.waset.org/abstracts/59115/parallel-vector-processing-using-multi-level-orbital-data" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/59115.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">270</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1268</span> Algorithm Optimization to Sort in Parallel by Decreasing the Number of the Processors in SIMD (Single Instruction Multiple Data) Systems </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ali%20Hosseini">Ali Hosseini</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Paralleling is a mechanism to decrease the time necessary to execute the programs. Sorting is one of the important operations to be used in different systems in a way that the proper function of many algorithms and operations depend on sorted data. CRCW_SORT algorithm executes ‘N’ elements sorting in O(1) time on SIMD (Single Instruction Multiple Data) computers with n^2/2-n/2 number of processors. In this article having presented a mechanism by dividing the input string by the hinge element into two less strings the number of the processors to be used in sorting ‘N’ elements in O(1) time has decreased to n^2/8-n/4 in the best state; by this mechanism the best state is when the hinge element is the middle one and the worst state is when it is minimum. The findings from assessing the proposed algorithm by other methods on data collection and number of the processors indicate that the proposed algorithm uses less processors to sort during execution than other methods. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=CRCW" title="CRCW">CRCW</a>, <a href="https://publications.waset.org/abstracts/search?q=SIMD%20%28Single%20Instruction%20Multiple%20Data%29%0D%0Acomputers" title=" SIMD (Single Instruction Multiple Data) computers"> SIMD (Single Instruction Multiple Data) computers</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20computers" title=" parallel computers"> parallel computers</a>, <a href="https://publications.waset.org/abstracts/search?q=number%20of%20the%0D%0Aprocessors" title=" number of the processors"> number of the processors</a> </p> <a href="https://publications.waset.org/abstracts/29094/algorithm-optimization-to-sort-in-parallel-by-decreasing-the-number-of-the-processors-in-simd-single-instruction-multiple-data-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/29094.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">310</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1267</span> Parallel 2-Opt Local Search on GPU</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Wen-Bao%20Qiao">Wen-Bao Qiao</a>, <a href="https://publications.waset.org/abstracts/search?q=Jean-Charles%20Cr%C3%A9put"> Jean-Charles Créput</a> </p> <p class="card-text"><strong>Abstract:</strong></p> To accelerate the solution for large scale traveling salesman problems (TSP), a parallel 2-opt local search algorithm with simple implementation based on Graphics Processing Unit (GPU) is presented and tested in this paper. The parallel scheme is based on technique of data decomposition by dynamically assigning multiple K processors on the integral tour to treat K edges’ 2-opt local optimization simultaneously on independent sub-tours, where K can be user-defined or have a function relationship with input size N. We implement this algorithm with doubly linked list on GPU. The implementation only requires O(N) memory. We compare this parallel 2-opt local optimization against sequential exhaustive 2-opt search along integral tour on TSP instances from TSPLIB with more than 10000 cities. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=parallel%202-opt" title="parallel 2-opt">parallel 2-opt</a>, <a href="https://publications.waset.org/abstracts/search?q=double%20links" title=" double links"> double links</a>, <a href="https://publications.waset.org/abstracts/search?q=large%20scale%20TSP" title=" large scale TSP"> large scale TSP</a>, <a href="https://publications.waset.org/abstracts/search?q=GPU" title=" GPU"> GPU</a> </p> <a href="https://publications.waset.org/abstracts/58582/parallel-2-opt-local-search-on-gpu" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/58582.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">625</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1266</span> Parallel Asynchronous Multi-Splitting Methods for Differential Algebraic Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Malika%20Elkyal">Malika Elkyal</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We consider an iterative parallel multi-splitting method for differential algebraic equations. The main feature of the proposed idea is to use the asynchronous form. We prove that the multi-splitting technique can effectively accelerate the convergent performance of the iterative process. The main characteristic of an asynchronous mode is that the local algorithm does not have to wait at predetermined messages to become available. We allow some processors to communicate more frequently than others, and we allow the communication delays to be substantial and unpredictable. Accordingly, we note that synchronous algorithms in the computer science sense are particular cases of our formulation of asynchronous one. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=parallel%20methods" title="parallel methods">parallel methods</a>, <a href="https://publications.waset.org/abstracts/search?q=asynchronous%20mode" title=" asynchronous mode"> asynchronous mode</a>, <a href="https://publications.waset.org/abstracts/search?q=multisplitting" title=" multisplitting"> multisplitting</a>, <a href="https://publications.waset.org/abstracts/search?q=differential%20algebraic%20equations" title=" differential algebraic equations"> differential algebraic equations</a> </p> <a href="https://publications.waset.org/abstracts/20673/parallel-asynchronous-multi-splitting-methods-for-differential-algebraic-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/20673.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">558</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1265</span> Performance Evaluation of Task Scheduling Algorithm on LCQ Network</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Zaki%20Ahmad%20Khan">Zaki Ahmad Khan</a>, <a href="https://publications.waset.org/abstracts/search?q=Jamshed%20Siddiqui"> Jamshed Siddiqui</a>, <a href="https://publications.waset.org/abstracts/search?q=Abdus%20Samad"> Abdus Samad</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The Scheduling and mapping of tasks on a set of processors is considered as a critical problem in parallel and distributed computing system. This paper deals with the problem of dynamic scheduling on a special type of multiprocessor architecture known as Linear Crossed Cube (LCQ) network. This proposed multiprocessor is a hybrid network which combines the features of both linear type of architectures as well as cube based architectures. Two standard dynamic scheduling schemes namely Minimum Distance Scheduling (MDS) and Two Round Scheduling (TRS) schemes are implemented on the LCQ network. Parallel tasks are mapped and the imbalance of load is evaluated on different set of processors in LCQ network. The simulations results are evaluated and effort is made by means of through analysis of the results to obtain the best solution for the given network in term of load imbalance left and execution time. The other performance matrices like speedup and efficiency are also evaluated with the given dynamic algorithms. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=dynamic%20algorithm" title="dynamic algorithm">dynamic algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=load%20imbalance" title=" load imbalance"> load imbalance</a>, <a href="https://publications.waset.org/abstracts/search?q=mapping" title=" mapping"> mapping</a>, <a href="https://publications.waset.org/abstracts/search?q=task%20scheduling" title=" task scheduling"> task scheduling</a> </p> <a href="https://publications.waset.org/abstracts/20290/performance-evaluation-of-task-scheduling-algorithm-on-lcq-network" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/20290.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">450</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1264</span> A Parallel Algorithm for Solving the PFSP on the Grid</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Samia%20Kouki">Samia Kouki</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Solving NP-hard combinatorial optimization problems by exact search methods, such as Branch-and-Bound, may degenerate to complete enumeration. For that reason, exact approaches limit us to solve only small or moderate size problem instances, due to the exponential increase in CPU time when problem size increases. One of the most promising ways to reduce significantly the computational burden of sequential versions of Branch-and-Bound is to design parallel versions of these algorithms which employ several processors. This paper describes a parallel Branch-and-Bound algorithm called GALB for solving the classical permutation flowshop scheduling problem as well as its implementation on a Grid computing infrastructure. The experimental study of our distributed parallel algorithm gives promising results and shows clearly the benefit of the parallel paradigm to solve large-scale instances in moderate CPU time. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=grid%20computing" title="grid computing">grid computing</a>, <a href="https://publications.waset.org/abstracts/search?q=permutation%20flow%20shop%20problem" title=" permutation flow shop problem"> permutation flow shop problem</a>, <a href="https://publications.waset.org/abstracts/search?q=branch%20and%20bound" title=" branch and bound"> branch and bound</a>, <a href="https://publications.waset.org/abstracts/search?q=load%20balancing" title=" load balancing"> load balancing</a> </p> <a href="https://publications.waset.org/abstracts/47518/a-parallel-algorithm-for-solving-the-pfsp-on-the-grid" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/47518.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">283</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1263</span> Multithreading/Multiprocessing Simulation of The International Space Station Multibody System Using A Divide and Conquer Dynamics Formulation with Flexible Bodies</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Luong%20A.%20Nguyen">Luong A. Nguyen</a>, <a href="https://publications.waset.org/abstracts/search?q=Elihu%20Deneke"> Elihu Deneke</a>, <a href="https://publications.waset.org/abstracts/search?q=Thomas%20L.%20Harman"> Thomas L. Harman</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper describes a multibody dynamics algorithm formulated for parallel implementation on multiprocessor computing platforms using the divide-and-conquer approach. The system of interest is a general topology of rigid and elastic articulated bodies with or without loops. The algorithm is an extension of Featherstone’s divide and conquer approach to include the flexible-body dynamics formulation. The equations of motion, configured for the International Space Station (ISS) with its robotic manipulator arm as a system of articulated flexible bodies, are implemented in separate computer processors. The performance of this divide-and-conquer algorithm implementation in multiple processors is compared with an existing method implemented on a single processor. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=multibody%20dynamics" title="multibody dynamics">multibody dynamics</a>, <a href="https://publications.waset.org/abstracts/search?q=multiple%20processors" title=" multiple processors"> multiple processors</a>, <a href="https://publications.waset.org/abstracts/search?q=multithreading" title=" multithreading"> multithreading</a>, <a href="https://publications.waset.org/abstracts/search?q=divide-and-conquer%20algorithm" title=" divide-and-conquer algorithm"> divide-and-conquer algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=computational%20efficiency" title=" computational efficiency"> computational efficiency</a>, <a href="https://publications.waset.org/abstracts/search?q=flexible%20body%20dynamics" title=" flexible body dynamics"> flexible body dynamics</a> </p> <a href="https://publications.waset.org/abstracts/60738/multithreadingmultiprocessing-simulation-of-the-international-space-station-multibody-system-using-a-divide-and-conquer-dynamics-formulation-with-flexible-bodies" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/60738.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">337</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1262</span> Parallel Multisplitting Methods for Differential Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Malika%20El%20Kyal">Malika El Kyal</a>, <a href="https://publications.waset.org/abstracts/search?q=Ahmed%20Machmoum"> Ahmed Machmoum</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We prove the superlinear convergence of asynchronous multi-splitting methods applied to differential equations. This study is based on the technique of nested sets. It permits to specify kind of the convergence in the asynchronous mode.The main characteristic of an asynchronous mode is that the local algorithm not have to wait at predetermined messages to become available. We allow some processors to communicate more frequently than others, and we allow the communication delays to be substantial and unpredictable. Note that synchronous algorithms in the computer science sense are particular cases of our formulation of asynchronous one. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=parallel%20methods" title="parallel methods">parallel methods</a>, <a href="https://publications.waset.org/abstracts/search?q=asynchronous%20mode" title=" asynchronous mode"> asynchronous mode</a>, <a href="https://publications.waset.org/abstracts/search?q=multisplitting" title=" multisplitting"> multisplitting</a>, <a href="https://publications.waset.org/abstracts/search?q=ODE" title=" ODE"> ODE</a> </p> <a href="https://publications.waset.org/abstracts/20675/parallel-multisplitting-methods-for-differential-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/20675.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">526</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1261</span> Task Scheduling on Parallel System Using Genetic Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jasbir%20Singh%20Gill">Jasbir Singh Gill</a>, <a href="https://publications.waset.org/abstracts/search?q=Baljit%20Singh"> Baljit Singh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Scheduling and mapping the application task graph on multiprocessor parallel systems is considered as the most crucial and critical NP-complete problem. Many genetic algorithms have been proposed to solve such problems. In this paper, two genetic approach based algorithms have been designed and developed with or without task duplication. The proposed algorithms work on two fitness functions. The first fitness i.e. task fitness is used to minimize the total finish time of the schedule (schedule length) while the second fitness function i.e. process fitness is concerned with allocating the tasks to the available highly efficient processor from the list of available processors (load balance). Proposed genetic-based algorithms have been experimentally implemented and evaluated with other state-of-art popular and widely used algorithms. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=parallel%20computing" title="parallel computing">parallel computing</a>, <a href="https://publications.waset.org/abstracts/search?q=task%20scheduling" title=" task scheduling"> task scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=task%20duplication" title=" task duplication"> task duplication</a>, <a href="https://publications.waset.org/abstracts/search?q=genetic%20algorithm" title=" genetic algorithm"> genetic algorithm</a> </p> <a href="https://publications.waset.org/abstracts/75569/task-scheduling-on-parallel-system-using-genetic-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/75569.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">349</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1260</span> Parallel Multisplitting Methods for DAE’s</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ahmed%20Machmoum">Ahmed Machmoum</a>, <a href="https://publications.waset.org/abstracts/search?q=Malika%20El%20Kyal"> Malika El Kyal</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We consider iterative parallel multi-splitting method for differential algebraic equations. The main feature of the proposed idea is to use the asynchronous form. We prove that the multi-splitting technique can effectively accelerate the convergent performance of the iterative process. The main characteristic of an asynchronous mode is that the local algorithm not have to wait at predetermined messages to become available. We allow some processors to communicate more frequently than others, and we allow the communication delays tobe substantial and unpredictable. Note that synchronous algorithms in the computer science sense are particular cases of our formulation of asynchronous one. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=computer" title="computer">computer</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-splitting%20methods" title=" multi-splitting methods"> multi-splitting methods</a>, <a href="https://publications.waset.org/abstracts/search?q=asynchronous%20mode" title=" asynchronous mode"> asynchronous mode</a>, <a href="https://publications.waset.org/abstracts/search?q=differential%20algebraic%20systems" title=" differential algebraic systems "> differential algebraic systems </a> </p> <a href="https://publications.waset.org/abstracts/23813/parallel-multisplitting-methods-for-daes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/23813.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">549</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1259</span> Parallel Version of Reinhard’s Color Transfer Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Abhishek%20Bhardwaj">Abhishek Bhardwaj</a>, <a href="https://publications.waset.org/abstracts/search?q=Manish%20Kumar%20Bajpai"> Manish Kumar Bajpai</a> </p> <p class="card-text"><strong>Abstract:</strong></p> An image with its content and schema of colors presents an effective mode of information sharing and processing. By changing its color schema different visions and prospect are discovered by the users. This phenomenon of color transfer is being used by Social media and other channel of entertainment. Reinhard et al’s algorithm was the first one to solve this problem of color transfer. In this paper, we make this algorithm efficient by introducing domain parallelism among different processors. We also comment on the factors that affect the speedup of this problem. In the end by analyzing the experimental data we claim to propose a novel and efficient parallel Reinhard’s algorithm. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Reinhard%20et%20al%E2%80%99s%20algorithm" title="Reinhard et al’s algorithm">Reinhard et al’s algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=color%20transferring" title=" color transferring"> color transferring</a>, <a href="https://publications.waset.org/abstracts/search?q=parallelism" title=" parallelism"> parallelism</a>, <a href="https://publications.waset.org/abstracts/search?q=speedup" title=" speedup"> speedup</a> </p> <a href="https://publications.waset.org/abstracts/21874/parallel-version-of-reinhards-color-transfer-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/21874.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">614</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1258</span> Numerical Studies for Standard Bi-Conjugate Gradient Stabilized Method and the Parallel Variants for Solving Linear Equations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kuniyoshi%20Abe">Kuniyoshi Abe</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Bi-conjugate gradient (Bi-CG) is a well-known method for solving linear equations Ax = b, for x, where A is a given n-by-n matrix, and b is a given n-vector. Typically, the dimension of the linear equation is high and the matrix is sparse. A number of hybrid Bi-CG methods such as conjugate gradient squared (CGS), Bi-CG stabilized (Bi-CGSTAB), BiCGStab2, and BiCGstab(l) have been developed to improve the convergence of Bi-CG. Bi-CGSTAB has been most often used for efficiently solving the linear equation, but we have seen the convergence behavior with a long stagnation phase. In such cases, it is important to have Bi-CG coefficients that are as accurate as possible, and the stabilization strategy, which stabilizes the computation of the Bi-CG coefficients, has been proposed. It may avoid stagnation and lead to faster computation. Motivated by a large number of processors in present petascale high-performance computing hardware, the scalability of Krylov subspace methods on parallel computers has recently become increasingly prominent. The main bottleneck for efficient parallelization is the inner products which require a global reduction. The resulting global synchronization phases cause communication overhead on parallel computers. The parallel variants of Krylov subspace methods reducing the number of global communication phases and hiding the communication latency have been proposed. However, the numerical stability, specifically, the convergence speed of the parallel variants of Bi-CGSTAB may become worse than that of the standard Bi-CGSTAB. In this paper, therefore, we compare the convergence speed between the standard Bi-CGSTAB and the parallel variants by numerical experiments and show that the convergence speed of the standard Bi-CGSTAB is faster than the parallel variants. Moreover, we propose the stabilization strategy for the parallel variants. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=bi-conjugate%20gradient%20stabilized%20method" title="bi-conjugate gradient stabilized method">bi-conjugate gradient stabilized method</a>, <a href="https://publications.waset.org/abstracts/search?q=convergence%20speed" title=" convergence speed"> convergence speed</a>, <a href="https://publications.waset.org/abstracts/search?q=Krylov%20subspace%20methods" title=" Krylov subspace methods"> Krylov subspace methods</a>, <a href="https://publications.waset.org/abstracts/search?q=linear%20equations" title=" linear equations"> linear equations</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20variant" title=" parallel variant"> parallel variant</a> </p> <a href="https://publications.waset.org/abstracts/96373/numerical-studies-for-standard-bi-conjugate-gradient-stabilized-method-and-the-parallel-variants-for-solving-linear-equations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/96373.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">164</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1257</span> Activities of Processors in Domestication/Conservation and Processing of Oil Bean (Pentaclethra macrophylla) in Enugu State, South East Nigeria</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Iwuchukwu%20J.%20C.">Iwuchukwu J. C.</a>, <a href="https://publications.waset.org/abstracts/search?q=Mbah%20C."> Mbah C.</a> </p> <p class="card-text"><strong>Abstract:</strong></p> There seems to be dearth on information on how oil bean is being exploited, processed and conserved locally. This gap stifles initiatives on the evaluation of the suitability of the methods used and the invention of new and better methods. The study; therefore, assesses activities of processors in domestication/conservation and processing of oil bean (Pentaclethra macrophylla) Enugu State, South East Nigeria. Three agricultural zones, three blocks, nine circles and seventy-two respondents that were purposively selected made up the sample for the study. Data were presented in percentage, chart and mean score. The result shows that processors of oil bean in the area were middle-aged, married with relatively large household size and long years of experience in processing. They sourced oil bean they processed from people’s farmland and sourced information on processing of oil bean from friends and relatives. Activities involved in processing of oil bean were boiling, dehulling, washing, sieving, slicing, wrapping. However, the sequence of these activities varies among these processors. Little or nothing was done by the processors towards the conservation of the crop while poor storage and processing facilities and lack of knowledge on modern preservation technique were major constraints to processing of oil bean in the area. The study concluded that efforts should be made by governments and processors through cooperative group in provision of processing and storage facility for oil bean while research institute should conserve and generate improved specie of the crop to arouse interest of the farmers and processors on the crop which will invariably increase productivity. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=conservation" title="conservation">conservation</a>, <a href="https://publications.waset.org/abstracts/search?q=domestication" title=" domestication"> domestication</a>, <a href="https://publications.waset.org/abstracts/search?q=oil%20bean" title=" oil bean"> oil bean</a>, <a href="https://publications.waset.org/abstracts/search?q=processing" title=" processing"> processing</a> </p> <a href="https://publications.waset.org/abstracts/27406/activities-of-processors-in-domesticationconservation-and-processing-of-oil-bean-pentaclethra-macrophylla-in-enugu-state-south-east-nigeria" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/27406.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">308</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1256</span> Damage Strain Analysis of Parallel Fiber Eutectic</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jian%20Zheng">Jian Zheng</a>, <a href="https://publications.waset.org/abstracts/search?q=Xinhua%20Ni"> Xinhua Ni</a>, <a href="https://publications.waset.org/abstracts/search?q=Xiequan%20Liu"> Xiequan Liu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> According to isotropy of parallel fiber eutectic, the no- damage strain field in parallel fiber eutectic is obtained from the flexibility tensor of parallel fiber eutectic. Considering the damage behavior of parallel fiber eutectic, damage variables are introduced to determine the strain field of parallel fiber eutectic. The damage strains in the matrix, interphase, and fiber of parallel fiber eutectic are quantitatively analyzed. Results show that damage strains are not only associated with the fiber volume fraction of parallel fiber eutectic, but also with the damage degree. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=damage%20strain" title="damage strain">damage strain</a>, <a href="https://publications.waset.org/abstracts/search?q=initial%20strain" title=" initial strain"> initial strain</a>, <a href="https://publications.waset.org/abstracts/search?q=fiber%20volume%20fraction" title=" fiber volume fraction"> fiber volume fraction</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20fiber%20eutectic" title=" parallel fiber eutectic"> parallel fiber eutectic</a> </p> <a href="https://publications.waset.org/abstracts/60032/damage-strain-analysis-of-parallel-fiber-eutectic" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/60032.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">577</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1255</span> Portable and Parallel Accelerated Development Method for Field-Programmable Gate Array (FPGA)-Central Processing Unit (CPU)- Graphics Processing Unit (GPU) Heterogeneous Computing</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Nan%20Hu">Nan Hu</a>, <a href="https://publications.waset.org/abstracts/search?q=Chao%20Wang"> Chao Wang</a>, <a href="https://publications.waset.org/abstracts/search?q=Xi%20Li"> Xi Li</a>, <a href="https://publications.waset.org/abstracts/search?q=Xuehai%20Zhou"> Xuehai Zhou</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The field-programmable gate array (FPGA) has been widely adopted in the high-performance computing domain. In recent years, the embedded system-on-a-chip (SoC) contains coarse granularity multi-core CPU (central processing unit) and mobile GPU (graphics processing unit) that can be used as general-purpose accelerators. The motivation is that algorithms of various parallel characteristics can be efficiently mapped to the heterogeneous architecture coupled with these three processors. The CPU and GPU offload partial computationally intensive tasks from the FPGA to reduce the resource consumption and lower the overall cost of the system. However, in present common scenarios, the applications always utilize only one type of accelerator because the development approach supporting the collaboration of the heterogeneous processors faces challenges. Therefore, a systematic approach takes advantage of write-once-run-anywhere portability, high execution performance of the modules mapped to various architectures and facilitates the exploration of design space. In this paper, A servant-execution-flow model is proposed for the abstraction of the cooperation of the heterogeneous processors, which supports task partition, communication and synchronization. At its first run, the intermediate language represented by the data flow diagram can generate the executable code of the target processor or can be converted into high-level programming languages. The instantiation parameters efficiently control the relationship between the modules and computational units, including two hierarchical processing units mapping and adjustment of data-level parallelism. An embedded system of a three-dimensional waveform oscilloscope is selected as a case study. The performance of algorithms such as contrast stretching, etc., are analyzed with implementations on various combinations of these processors. The experimental results show that the heterogeneous computing system with less than 35% resources achieves similar performance to the pure FPGA and approximate energy efficiency. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=FPGA-CPU-GPU%20collaboration" title="FPGA-CPU-GPU collaboration">FPGA-CPU-GPU collaboration</a>, <a href="https://publications.waset.org/abstracts/search?q=design%20space%20exploration" title=" design space exploration"> design space exploration</a>, <a href="https://publications.waset.org/abstracts/search?q=heterogeneous%20computing" title=" heterogeneous computing"> heterogeneous computing</a>, <a href="https://publications.waset.org/abstracts/search?q=intermediate%20language" title=" intermediate language"> intermediate language</a>, <a href="https://publications.waset.org/abstracts/search?q=parameterized%20instantiation" title=" parameterized instantiation"> parameterized instantiation</a> </p> <a href="https://publications.waset.org/abstracts/150890/portable-and-parallel-accelerated-development-method-for-field-programmable-gate-array-fpga-central-processing-unit-cpu-graphics-processing-unit-gpu-heterogeneous-computing" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/150890.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">118</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1254</span> A Methodology for the Synthesis of Multi-Processors</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hamid%20Yasinian">Hamid Yasinian</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Random epistemologies and hash tables have garnered minimal interest from both security experts and experts in the last several years. In fact, few information theorists would disagree with the evaluation of expert systems. In our research, we discover how flip-flop gates can be applied to the study of superpages. Though such a hypothesis at first glance seems perverse, it is derived from known results. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=synthesis" title="synthesis">synthesis</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-processors" title=" multi-processors"> multi-processors</a>, <a href="https://publications.waset.org/abstracts/search?q=interactive%20model" title=" interactive model"> interactive model</a>, <a href="https://publications.waset.org/abstracts/search?q=moor%E2%80%99s%20law" title=" moor’s law"> moor’s law</a> </p> <a href="https://publications.waset.org/abstracts/19087/a-methodology-for-the-synthesis-of-multi-processors" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/19087.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">436</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1253</span> Parallel PRBS Generation and Parallel BER Tester for 8-Gbps On-chip Interconnection Testing</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Zhao%20Bin">Zhao Bin</a>, <a href="https://publications.waset.org/abstracts/search?q=Yan%20Dan%20Lei"> Yan Dan Lei</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, a multi-pattern parallel PRBS generator and a dedicated parallel BER tester is proposed for the 8-Gbps On-chip interconnection testing. A unique full-parallel PRBS checker is also proposed. The proposed design, together with the custom-designed high-speed parallel-to-serial and the serial-to-parallel circuit, will be used to test different on-chip interconnection transceivers. The design is implemented in TSMC 28nm CMOS technology with working voltage at 1.0 V. The serial to parallel ratio is 8:1 so the parallel PRBS generation and BER Tester can be run at lower speed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=PRBS" title="PRBS">PRBS</a>, <a href="https://publications.waset.org/abstracts/search?q=BER" title=" BER"> BER</a>, <a href="https://publications.waset.org/abstracts/search?q=high%20speed" title=" high speed"> high speed</a>, <a href="https://publications.waset.org/abstracts/search?q=generator" title=" generator"> generator</a> </p> <a href="https://publications.waset.org/abstracts/35064/parallel-prbs-generation-and-parallel-ber-tester-for-8-gbps-on-chip-interconnection-testing" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/35064.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">760</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1252</span> DNA Multiplier: A Design Architecture of a Multiplier Circuit Using DNA Molecules</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hafiz%20Md.%20Hasan%20Babu">Hafiz Md. Hasan Babu</a>, <a href="https://publications.waset.org/abstracts/search?q=Khandaker%20Mohammad%20Mohi%20Uddin"> Khandaker Mohammad Mohi Uddin</a>, <a href="https://publications.waset.org/abstracts/search?q=Nitish%20Biswas"> Nitish Biswas</a>, <a href="https://publications.waset.org/abstracts/search?q=Sarreha%20Tasmin%20Rikta"> Sarreha Tasmin Rikta</a>, <a href="https://publications.waset.org/abstracts/search?q=Nuzmul%20Hossain%20Nahid"> Nuzmul Hossain Nahid</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Nanomedicine and bioengineering use biological systems that can perform computing operations. In a biocomputational circuit, different types of biomolecules and DNA (Deoxyribose Nucleic Acid) are used as active components. DNA computing has the capability of performing parallel processing and a large storage capacity that makes it diverse from other computing systems. In most processors, the multiplier is treated as a core hardware block, and multiplication is one of the time-consuming and lengthy tasks. In this paper, cost-effective DNA multipliers are designed using algorithms of molecular DNA operations with respect to conventional ones. The speed and storage capacity of a DNA multiplier are also much higher than a traditional silicon-based multiplier. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=biological%20systems" title="biological systems">biological systems</a>, <a href="https://publications.waset.org/abstracts/search?q=DNA%20multiplier" title=" DNA multiplier"> DNA multiplier</a>, <a href="https://publications.waset.org/abstracts/search?q=large%20storage" title=" large storage"> large storage</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20processing" title=" parallel processing"> parallel processing</a> </p> <a href="https://publications.waset.org/abstracts/141053/dna-multiplier-a-design-architecture-of-a-multiplier-circuit-using-dna-molecules" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/141053.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">214</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1251</span> A Parallel Implementation of k-Means in MATLAB</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Dimitris%20Varsamis">Dimitris Varsamis</a>, <a href="https://publications.waset.org/abstracts/search?q=Christos%20Talagkozis"> Christos Talagkozis</a>, <a href="https://publications.waset.org/abstracts/search?q=Alkiviadis%20Tsimpiris"> Alkiviadis Tsimpiris</a>, <a href="https://publications.waset.org/abstracts/search?q=Paris%20Mastorocostas"> Paris Mastorocostas</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The aim of this work is the parallel implementation of k-means in MATLAB, in order to reduce the execution time. Specifically, a new function in MATLAB for serial k-means algorithm is developed, which meets all the requirements for the conversion to a function in MATLAB with parallel computations. Additionally, two different variants for the definition of initial values are presented. In the sequel, the parallel approach is presented. Finally, the performance tests for the computation times respect to the numbers of features and classes are illustrated. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=K-means%20algorithm" title="K-means algorithm">K-means algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=clustering" title=" clustering"> clustering</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20computations" title=" parallel computations"> parallel computations</a>, <a href="https://publications.waset.org/abstracts/search?q=Matlab" title=" Matlab"> Matlab</a> </p> <a href="https://publications.waset.org/abstracts/80503/a-parallel-implementation-of-k-means-in-matlab" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/80503.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">385</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1250</span> A Survey on Constraint Solving Approaches Using Parallel Architectures</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Nebras%20Gharbi">Nebras Gharbi</a>, <a href="https://publications.waset.org/abstracts/search?q=Itebeddine%20Ghorbel"> Itebeddine Ghorbel</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In the latest years and with the advancements of the multicore computing world, the constraint programming community tried to benefit from the capacity of new machines and make the best use of them through several parallel schemes for constraint solving. In this paper, we propose a survey of the different proposed approaches to solve Constraint Satisfaction Problems using parallel architectures. These approaches use in a different way a parallel architecture: the problem itself could be solved differently by several solvers or could be split over solvers. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=constraint%20programming" title="constraint programming">constraint programming</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20programming" title=" parallel programming"> parallel programming</a>, <a href="https://publications.waset.org/abstracts/search?q=constraint%20satisfaction%20problem" title=" constraint satisfaction problem"> constraint satisfaction problem</a>, <a href="https://publications.waset.org/abstracts/search?q=speed-up" title=" speed-up"> speed-up</a> </p> <a href="https://publications.waset.org/abstracts/50394/a-survey-on-constraint-solving-approaches-using-parallel-architectures" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/50394.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">319</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1249</span> Private Coded Computation of Matrix Multiplication</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Malihe%20Aliasgari">Malihe Aliasgari</a>, <a href="https://publications.waset.org/abstracts/search?q=Yousef%20Nejatbakhsh"> Yousef Nejatbakhsh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The era of Big Data and the immensity of real-life datasets compels computation tasks to be performed in a distributed fashion, where the data is dispersed among many servers that operate in parallel. However, massive parallelization leads to computational bottlenecks due to faulty servers and stragglers. Stragglers refer to a few slow or delay-prone processors that can bottleneck the entire computation because one has to wait for all the parallel nodes to finish. The problem of straggling processors, has been well studied in the context of distributed computing. Recently, it has been pointed out that, for the important case of linear functions, it is possible to improve over repetition strategies in terms of the tradeoff between performance and latency by carrying out linear precoding of the data prior to processing. The key idea is that, by employing suitable linear codes operating over fractions of the original data, a function may be completed as soon as enough number of processors, depending on the minimum distance of the code, have completed their operations. The problem of matrix-matrix multiplication in the presence of practically big sized of data sets faced with computational and memory related difficulties, which makes such operations are carried out using distributed computing platforms. In this work, we study the problem of distributed matrix-matrix multiplication W = XY under storage constraints, i.e., when each server is allowed to store a fixed fraction of each of the matrices X and Y, which is a fundamental building of many science and engineering fields such as machine learning, image and signal processing, wireless communication, optimization. Non-secure and secure matrix multiplication are studied. We want to study the setup, in which the identity of the matrix of interest should be kept private from the workers and then obtain the recovery threshold of the colluding model, that is, the number of workers that need to complete their task before the master server can recover the product W. The problem of secure and private distributed matrix multiplication W = XY which the matrix X is confidential, while matrix Y is selected in a private manner from a library of public matrices. We present the best currently known trade-off between communication load and recovery threshold. On the other words, we design an achievable PSGPD scheme for any arbitrary privacy level by trivially concatenating a robust PIR scheme for arbitrary colluding workers and private databases and the proposed SGPD code that provides a smaller computational complexity at the workers. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=coded%20distributed%20computation" title="coded distributed computation">coded distributed computation</a>, <a href="https://publications.waset.org/abstracts/search?q=private%20information%20retrieval" title=" private information retrieval"> private information retrieval</a>, <a href="https://publications.waset.org/abstracts/search?q=secret%20sharing" title=" secret sharing"> secret sharing</a>, <a href="https://publications.waset.org/abstracts/search?q=stragglers" title=" stragglers"> stragglers</a> </p> <a href="https://publications.waset.org/abstracts/144645/private-coded-computation-of-matrix-multiplication" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/144645.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">122</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1248</span> Economic Analysis of Cassava Value Chain by Farmers in Ilesa West Local Government Area of Osun State</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Maikasuwa%20Mohammed%20Abubakar">Maikasuwa Mohammed Abubakar</a>, <a href="https://publications.waset.org/abstracts/search?q=Okebiorun%20Ola"> Okebiorun Ola</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20H.%20Sidi"> M. H. Sidi</a>, <a href="https://publications.waset.org/abstracts/search?q=Ala%20Ahmed%20Ladan"> Ala Ahmed Ladan</a>, <a href="https://publications.waset.org/abstracts/search?q=Ango%20Aabdullahi%20Kamba"> Ango Aabdullahi Kamba</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The study examines the economic analysis of cassava value chain by farmers in Ilesa West Local Government Area of Osun State. Simple random sampling technique was used to collect data from 200 respondents from purposively selected wards in the L.G.A. The data collected were analyzed using budgetary analysis and value addition model. The result shows that an average total cost incurred by the input dealers was ₦9,062,127.74 while the average net profit realized was ₦1,038,102.40. Other actors such as producers, processors and marketers incurred an average total cost of ₦23,324.00, ₦130,177.00 and ₦523,755.00 per production season, respectively and the average net profit realized was ₦102,614.00 for cassava producers, ₦51,131.00 for cassava processors and ₦79,045.00 for cassava marketers during cassava production season. Further analysis shows the rate of investment for cassava input dealers was ₦0.1, for cassava producers was ₦4.4, for cassava processors were ₦0.40 and for cassava marketers was ₦0.20. This indicated that rate of return on cassava was higher in cassava production than in others corridors along the value chain of cassava. However, value added the cassava producers (₦102,536.16/season) was the highest when compared with value added by cassava processors (₦51,853.82/season) and cassava marketers (₦100,885.56/season). <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Cassava" title="Cassava">Cassava</a>, <a href="https://publications.waset.org/abstracts/search?q=value%20chain" title=" value chain"> value chain</a>, <a href="https://publications.waset.org/abstracts/search?q=Ilesa%20West" title=" Ilesa West"> Ilesa West</a>, <a href="https://publications.waset.org/abstracts/search?q=Nigeria" title=" Nigeria"> Nigeria</a> </p> <a href="https://publications.waset.org/abstracts/48392/economic-analysis-of-cassava-value-chain-by-farmers-in-ilesa-west-local-government-area-of-osun-state" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/48392.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">333</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1247</span> Information Needs of Cassava Processors on Small-Scale Cassava Processing in Oyo State, Nigeria</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rafiat%20Bolanle%20Fasasi-Hammed">Rafiat Bolanle Fasasi-Hammed</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Cassava is an important food crop in rural households of Nigeria. It has a high potential for product diversification, because it can be processed into various products forms for human consumption and can be made into chips for farm animals, and also starch and starch derivatives. However, cassava roots are highly perishable and contain potentially toxic cyanogenic glycosides which necessitate its processing. Therefore, this study was carried out to assess information needs of cassava processors on food safety practices in Oyo State, Nigeria. Simple random sampling technique was used in the selection of 110 respondents for this study. Descriptive statistics and chi-square were used to analyze the data collected. Results of this study showed that the mean age of the respondents was 39.4 years, majority (78.7%) of the respondents was married, 51.9% had secondary education; 45.8% of the respondents have spent more than 12 years in cassava processing. The mean income realized was ₦26,347.50/month from cassava processing. Information on cassava processing got to the respondents through friends, family and relations (73.6%) and fellow cassava processors (58.6%). Serious constraints identified were ineffective extension agents (93.9%), food safety regulatory agencies (88.1%) and inadequate processing and storage facilities (67.8%). Chi-square results showed that significant relationship existed between socio-economic characteristics of the respondents (χ2 = 29.80, df = 2,), knowledge level (χ2 = 9.26, df = 4), constraints (χ2 = 13.11, df = 2) and information needs at p < 0.05 level of significance. The study recommends that there should be regular training on improved cassava processing methods for the cassava processors in the study area. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=information" title="information">information</a>, <a href="https://publications.waset.org/abstracts/search?q=needs" title=" needs"> needs</a>, <a href="https://publications.waset.org/abstracts/search?q=cassava" title=" cassava"> cassava</a>, <a href="https://publications.waset.org/abstracts/search?q=Oyo%20State" title=" Oyo State"> Oyo State</a>, <a href="https://publications.waset.org/abstracts/search?q=processing" title=" processing"> processing</a> </p> <a href="https://publications.waset.org/abstracts/93162/information-needs-of-cassava-processors-on-small-scale-cassava-processing-in-oyo-state-nigeria" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/93162.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">302</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1246</span> Profitability Analysis of Investment in Oil Palm Value Chain in Osun State, Nigeria</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Moyosooore%20A.%20Babalola">Moyosooore A. Babalola</a>, <a href="https://publications.waset.org/abstracts/search?q=Ayodeji%20S.%20Ogunleye"> Ayodeji S. Ogunleye</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The main focus of the study was to determine the profitability of investment in the Oil Palm value chain of Osun State, Nigeria in 2015. The specific objectives were to describe the socio-economic characteristics of Oil Palm investors (producers, processors and marketers), to determine the profitability of the investment to investors in the Oil Palm value chain, and to determine the factors affecting the profitability of the investment of the oil palm investors in Osun state. A sample of 100 respondents was selected in this cross-sectional survey. Multiple stage sampling procedure was used for data collection of producers and processors while purposive sampling was used for marketers. Data collected was analyzed using the following analytical tools: descriptive statistics, budgetary analysis and regression analysis. The results of the gross margin showed that the producers and processors were more profitable than the marketers in the oil palm value chain with their benefit-cost ratios as 1.93, 1.82 and 1.11 respectively. The multiple regression analysis showed that education and years of experience were significant among marketers and producers while age and years of experience had significant influence on the gross margin of processors. Based on these findings, improvement on the level of education of oil palm investors is recommended in order to address the relatively low access to post-primary education among the oil palm investors in Osun State. In addition to this, it is important that training be made available to oil palm investors. This will improve the quality of their years of experience, ensuring that it has a positive influence on their gross margin. Low access to credit among processors and producer could be corrected by making extension services available to them. Marketers would also greatly benefit from subsidized prices on oil palm products to increase their gross margin, as the huge percentage of their total cost comes from acquiring palm oil. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=oil%20palm" title="oil palm">oil palm</a>, <a href="https://publications.waset.org/abstracts/search?q=profitability%20analysis" title=" profitability analysis"> profitability analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=regression%20analysis" title=" regression analysis"> regression analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=value%20chain" title=" value chain"> value chain</a> </p> <a href="https://publications.waset.org/abstracts/64208/profitability-analysis-of-investment-in-oil-palm-value-chain-in-osun-state-nigeria" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/64208.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">363</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1245</span> Software Transactional Memory in a Dynamic Programming Language at Virtual Machine Level</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Szu-Kai%20Hsu">Szu-Kai Hsu</a>, <a href="https://publications.waset.org/abstracts/search?q=Po-Ching%20Lin"> Po-Ching Lin</a> </p> <p class="card-text"><strong>Abstract:</strong></p> As more and more multi-core processors emerge, traditional sequential programming paradigm no longer suffice. Yet only few modern dynamic programming languages can leverage such advantage. Ruby, for example, despite its wide adoption, only includes threads as a simple parallel primitive. The global virtual machine lock of official Ruby runtime makes it impossible to exploit full parallelism. Though various alternative Ruby implementations do eliminate the global virtual machine lock, they only provide developers dated locking mechanism for data synchronization. However, traditional locking mechanism error-prone by nature. Software Transactional Memory is one of the promising alternatives among others. This paper introduces a new virtual machine: GobiesVM to provide a native software transactional memory based solution for dynamic programming languages to exploit parallelism. We also proposed a simplified variation of Transactional Locking II algorithm. The empirical results of our experiments show that support of STM at virtual machine level enables developers to write straightforward code without compromising parallelism or sacrificing thread safety. Existing source code only requires minimal or even none modi cation, which allows developers to easily switch their legacy codebase to a parallel environment. The performance evaluations of GobiesVM also indicate the difference between sequential and parallel execution is significant. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=global%20interpreter%20lock" title="global interpreter lock">global interpreter lock</a>, <a href="https://publications.waset.org/abstracts/search?q=ruby" title=" ruby"> ruby</a>, <a href="https://publications.waset.org/abstracts/search?q=software%20transactional%20memory" title=" software transactional memory"> software transactional memory</a>, <a href="https://publications.waset.org/abstracts/search?q=virtual%20machine" title=" virtual machine"> virtual machine</a> </p> <a href="https://publications.waset.org/abstracts/17152/software-transactional-memory-in-a-dynamic-programming-language-at-virtual-machine-level" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/17152.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">285</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1244</span> The Vision Baed Parallel Robot Control</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sun%20Lim">Sun Lim</a>, <a href="https://publications.waset.org/abstracts/search?q=Kyun%20Jung"> Kyun Jung</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we describe the control strategy of high speed parallel robot system with EtherCAT network. This work deals the parallel robot system with centralized control on the real-time operating system such as window TwinCAT3. Most control scheme and algorithm is implemented master platform on the PC, the input and output interface is ported on the slave side. The data is transferred by maximum 20usecond with 1000byte. EtherCAT is very high speed and stable industrial network. The control strategy with EtherCAT is very useful and robust on Ethernet network environment. The developed parallel robot is controlled pre-design nonlinear controller for 6G/0.43 cycle time of pick and place motion tracking. The experiment shows the good design and validation of the controller. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=parallel%20robot%20control" title="parallel robot control">parallel robot control</a>, <a href="https://publications.waset.org/abstracts/search?q=etherCAT" title=" etherCAT"> etherCAT</a>, <a href="https://publications.waset.org/abstracts/search?q=nonlinear%20control" title=" nonlinear control"> nonlinear control</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20robot%20inverse%20kinematic" title=" parallel robot inverse kinematic"> parallel robot inverse kinematic</a> </p> <a href="https://publications.waset.org/abstracts/27428/the-vision-baed-parallel-robot-control" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/27428.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">571</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1243</span> Rural Women’s Skill Acquisition in the Processing of Locust Bean in Ipokia Local Government Area of Ogun State, Nigeria</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=A.%20A.%20Adekunle">A. A. Adekunle</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20M.%20Omoare"> A. M. Omoare</a>, <a href="https://publications.waset.org/abstracts/search?q=W.%20O.%20Oyediran"> W. O. Oyediran</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This study was carried out to assess rural women’s skill acquisition in the processing of locust bean in Ipokia Local Government Area of Ogun State, Nigeria. Simple random sampling technique was used to select 90 women locust bean processors for this study. Data were analyzed with descriptive statistics and Pearson Product Moment Correlation. The result showed that the mean age of respondents was 40.72 years. Most (70.00%) of the respondents were married. The mean processing experience was 8.63 years. 93.30% of the respondents relied on information from fellow locust beans processors and friends. All (100%) the respondents did not acquire improved processing skill through trainings and workshops. It can be concluded that the rural women’s skill acquisition on modernized processing techniques was generally low. It is hereby recommend that the rural women processors should be trained by extension service providers through series of workshops and seminars on improved processing techniques. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=locust%20bean" title="locust bean">locust bean</a>, <a href="https://publications.waset.org/abstracts/search?q=processing" title=" processing"> processing</a>, <a href="https://publications.waset.org/abstracts/search?q=skill%20acquisition" title=" skill acquisition"> skill acquisition</a>, <a href="https://publications.waset.org/abstracts/search?q=rural%20women" title=" rural women"> rural women</a> </p> <a href="https://publications.waset.org/abstracts/4247/rural-womens-skill-acquisition-in-the-processing-of-locust-bean-in-ipokia-local-government-area-of-ogun-state-nigeria" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/4247.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">461</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1242</span> Flowing Online Vehicle GPS Data Clustering Using a New Parallel K-Means Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Orhun%20Vural">Orhun Vural</a>, <a href="https://publications.waset.org/abstracts/search?q=Oguz%20%20Bayat"> Oguz Bayat</a>, <a href="https://publications.waset.org/abstracts/search?q=Rustu%20Akay"> Rustu Akay</a>, <a href="https://publications.waset.org/abstracts/search?q=Osman%20N.%20Ucan"> Osman N. Ucan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This study presents a new parallel approach clustering of GPS data. Evaluation has been made by comparing execution time of various clustering algorithms on GPS data. This paper aims to propose a parallel based on neighborhood K-means algorithm to make it faster. The proposed parallelization approach assumes that each GPS data represents a vehicle and to communicate between vehicles close to each other after vehicles are clustered. This parallelization approach has been examined on different sized continuously changing GPS data and compared with serial K-means algorithm and other serial clustering algorithms. The results demonstrated that proposed parallel K-means algorithm has been shown to work much faster than other clustering algorithms. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=parallel%20k-means%20algorithm" title="parallel k-means algorithm">parallel k-means algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20clustering" title=" parallel clustering"> parallel clustering</a>, <a href="https://publications.waset.org/abstracts/search?q=clustering%20algorithms" title=" clustering algorithms"> clustering algorithms</a>, <a href="https://publications.waset.org/abstracts/search?q=clustering%20on%20flowing%20data" title=" clustering on flowing data"> clustering on flowing data</a> </p> <a href="https://publications.waset.org/abstracts/86622/flowing-online-vehicle-gps-data-clustering-using-a-new-parallel-k-means-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/86622.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">222</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1241</span> Design of Local Interconnect Network Controller for Automotive Applications</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jong-Bae%20Lee">Jong-Bae Lee</a>, <a href="https://publications.waset.org/abstracts/search?q=Seongsoo%20Lee"> Seongsoo Lee</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Local interconnect network (LIN) is a communication protocol that combines sensors, actuators, and processors to a functional module in automotive applications. In this paper, a LIN ver. 2.2A controller was designed in Verilog hardware description language (Verilog HDL) and implemented in field-programmable gate array (FPGA). Its operation was verified by making full-scale LIN network with the presented FPGA-implemented LIN controller, commercial LIN transceivers, and commercial processors. When described in Verilog HDL and synthesized in 0.18 μm technology, its gate size was about 2,300 gates. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=local%20interconnect%20network" title="local interconnect network">local interconnect network</a>, <a href="https://publications.waset.org/abstracts/search?q=controller" title=" controller"> controller</a>, <a href="https://publications.waset.org/abstracts/search?q=transceiver" title=" transceiver"> transceiver</a>, <a href="https://publications.waset.org/abstracts/search?q=processor" title=" processor"> processor</a> </p> <a href="https://publications.waset.org/abstracts/60861/design-of-local-interconnect-network-controller-for-automotive-applications" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/60861.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">288</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1240</span> Parallelization by Domain Decomposition for 1-D Sugarcane Equation with Message Passing Interface</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ewedafe%20Simon%20Uzezi">Ewedafe Simon Uzezi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper we presented a method based on Domain Decomposition (DD) for parallelization of 1-D Sugarcane Equation on parallel platform with parallel paradigms on Master-Slave platform using Message Passing Interface (MPI). The 1-D Sugarcane Equation was discretized using explicit method of discretization requiring evaluation nof temporal and spatial distribution of temperature. This platform gives better predictions of the effects of temperature distribution of the sugarcane problem. This work presented parallel overheads with overlapping communication and communication across parallel computers with numerical results across different block sizes with scalability. However, performance improvement strategies from the DD on various mesh sizes were compared experimentally and parallel results show speedup and efficiency for the parallel algorithms design. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=sugarcane" title="sugarcane">sugarcane</a>, <a href="https://publications.waset.org/abstracts/search?q=parallelization" title=" parallelization"> parallelization</a>, <a href="https://publications.waset.org/abstracts/search?q=explicit%20method" title=" explicit method"> explicit method</a>, <a href="https://publications.waset.org/abstracts/search?q=domain%20decomposition" title=" domain decomposition"> domain decomposition</a>, <a href="https://publications.waset.org/abstracts/search?q=MPI" title=" MPI"> MPI</a> </p> <a href="https://publications.waset.org/abstracts/192206/parallelization-by-domain-decomposition-for-1-d-sugarcane-equation-with-message-passing-interface" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/192206.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">21</span> </span> </div> </div> <ul class="pagination"> <li class="page-item disabled"><span class="page-link">‹</span></li> <li class="page-item active"><span class="page-link">1</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Parallel%20Processors&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Parallel%20Processors&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Parallel%20Processors&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Parallel%20Processors&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Parallel%20Processors&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Parallel%20Processors&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Parallel%20Processors&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Parallel%20Processors&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Parallel%20Processors&page=10">10</a></li> <li class="page-item disabled"><span class="page-link">...</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Parallel%20Processors&page=42">42</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Parallel%20Processors&page=43">43</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Parallel%20Processors&page=2" rel="next">›</a></li> </ul> </div> </main> <footer> <div id="infolinks" class="pt-3 pb-2"> <div class="container"> <div style="background-color:#f5f5f5;" class="p-3"> <div class="row"> <div class="col-md-2"> <ul class="list-unstyled"> About <li><a href="https://waset.org/page/support">About Us</a></li> <li><a href="https://waset.org/page/support#legal-information">Legal</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/WASET-16th-foundational-anniversary.pdf">WASET celebrates its 16th foundational anniversary</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Account <li><a href="https://waset.org/profile">My Account</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Explore <li><a href="https://waset.org/disciplines">Disciplines</a></li> <li><a href="https://waset.org/conferences">Conferences</a></li> <li><a href="https://waset.org/conference-programs">Conference Program</a></li> <li><a href="https://waset.org/committees">Committees</a></li> <li><a href="https://publications.waset.org">Publications</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Research <li><a href="https://publications.waset.org/abstracts">Abstracts</a></li> <li><a href="https://publications.waset.org">Periodicals</a></li> <li><a href="https://publications.waset.org/archive">Archive</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Open Science <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Philosophy.pdf">Open Science Philosophy</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Award.pdf">Open Science Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Society-Open-Science-and-Open-Innovation.pdf">Open Innovation</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Postdoctoral-Fellowship-Award.pdf">Postdoctoral Fellowship Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Scholarly-Research-Review.pdf">Scholarly Research Review</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Support <li><a href="https://waset.org/page/support">Support</a></li> <li><a href="https://waset.org/profile/messages/create">Contact Us</a></li> <li><a href="https://waset.org/profile/messages/create">Report Abuse</a></li> </ul> </div> </div> </div> </div> </div> <div class="container text-center"> <hr style="margin-top:0;margin-bottom:.3rem;"> <a href="https://creativecommons.org/licenses/by/4.0/" target="_blank" class="text-muted small">Creative Commons Attribution 4.0 International License</a> <div id="copy" class="mt-2">© 2024 World Academy of Science, Engineering and Technology</div> </div> </footer> <a href="javascript:" id="return-to-top"><i class="fas fa-arrow-up"></i></a> <div class="modal" id="modal-template"> <div class="modal-dialog"> <div class="modal-content"> <div class="row m-0 mt-1"> <div class="col-md-12"> <button type="button" class="close" data-dismiss="modal" aria-label="Close"><span aria-hidden="true">×</span></button> </div> </div> <div class="modal-body"></div> </div> </div> </div> <script src="https://cdn.waset.org/static/plugins/jquery-3.3.1.min.js"></script> <script src="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/js/bootstrap.bundle.min.js"></script> <script src="https://cdn.waset.org/static/js/site.js?v=150220211556"></script> <script> jQuery(document).ready(function() { /*jQuery.get("https://publications.waset.org/xhr/user-menu", function (response) { jQuery('#mainNavMenu').append(response); });*/ jQuery.get({ url: "https://publications.waset.org/xhr/user-menu", cache: false }).then(function(response){ jQuery('#mainNavMenu').append(response); }); }); </script> </body> </html>