CINXE.COM

<!DOCTYPE html> <html lang="en" dir="ltr"> <head>  <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>  <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>    <title>Search results for: parallel computing</title> <meta name="description" content="Search results for: parallel computing"> <meta name="keywords" content="parallel computing"> <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 computing" 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 computing"> <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> 2100</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: parallel computing</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2100</span> Exploring MPI-Based Parallel Computing in Analyzing Very Large Sequences</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Bilal%20Wajid">Bilal Wajid</a>, <a href="https://publications.waset.org/abstracts/search?q=Erchin%20Serpedin"> Erchin Serpedin</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The health industry is aiming towards personalized medicine. If the patient鈥檚 genome needs to be sequenced it is important that the entire analysis be completed quickly. This paper explores use of parallel computing to analyze very large sequences. Two cases have been considered. In the first case, the sequence is kept constant and the effect of increasing the number of MPI-based processes is evaluated in terms of execution time, speed and efficiency. In the second case the number of MPI-based processes have been kept constant whereas, the length of the sequence was increased. <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=alignment" title=" alignment"> alignment</a>, <a href="https://publications.waset.org/abstracts/search?q=genome%20assembly" title=" genome assembly"> genome assembly</a>, <a href="https://publications.waset.org/abstracts/search?q=alignment" title=" alignment"> alignment</a> </p> <a href="https://publications.waset.org/abstracts/40924/exploring-mpi-based-parallel-computing-in-analyzing-very-large-sequences" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/40924.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">274</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">2099</span> Researching Apache Hama: A Pure BSP Computing Framework</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kamran%20Siddique">Kamran Siddique</a>, <a href="https://publications.waset.org/abstracts/search?q=Yangwoo%20Kim"> Yangwoo Kim</a>, <a href="https://publications.waset.org/abstracts/search?q=Zahid%20Akhtar"> Zahid Akhtar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In recent years, the technological advancements have led to a deluge of data from distinctive domains and the need for development of solutions based on parallel and distributed computing has still long way to go. That is why, the research and development of massive computing frameworks is continuously growing. At this particular stage, highlighting a potential research area along with key insights could be an asset for researchers in the field. Therefore, this paper explores one of the emerging distributed computing frameworks, Apache Hama. It is a Top Level Project under the Apache Software Foundation, based on Bulk Synchronous Processing (BSP). We present an unbiased and critical interrogation session about Apache Hama and conclude research directions in order to assist interested researchers. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=apache%20hama" title="apache hama">apache hama</a>, <a href="https://publications.waset.org/abstracts/search?q=bulk%20synchronous%20parallel" title=" bulk synchronous parallel"> bulk synchronous parallel</a>, <a href="https://publications.waset.org/abstracts/search?q=BSP" title=" BSP"> BSP</a>, <a href="https://publications.waset.org/abstracts/search?q=distributed%20computing" title=" distributed computing"> distributed computing</a> </p> <a href="https://publications.waset.org/abstracts/45015/researching-apache-hama-a-pure-bsp-computing-framework" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/45015.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">250</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">2098</span> Parallel Computing: Offloading Matrix Multiplication to GPU</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Bharath%20R.">Bharath R.</a>, <a href="https://publications.waset.org/abstracts/search?q=Tharun%20Sai%20N."> Tharun Sai N.</a>, <a href="https://publications.waset.org/abstracts/search?q=Bhuvan%20G."> Bhuvan G.</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This project focuses on developing a Parallel Computing method aimed at optimizing matrix multiplication through GPU acceleration. Addressing algorithmic challenges, GPU programming intricacies, and integration issues, the project aims to enhance efficiency and scalability. The methodology involves algorithm design, GPU programming, and optimization techniques. Future plans include advanced optimizations, extended functionality, and integration with high-level frameworks. User engagement is emphasized through user-friendly interfaces, open- source collaboration, and continuous refinement based on feedback. The project's impact extends to significantly improving matrix multiplication performance in scientific computing and machine learning applications. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=matrix%20multiplication" title="matrix multiplication">matrix multiplication</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20processing" title=" parallel processing"> parallel processing</a>, <a href="https://publications.waset.org/abstracts/search?q=cuda" title=" cuda"> cuda</a>, <a href="https://publications.waset.org/abstracts/search?q=performance%20boost" title=" performance boost"> performance boost</a>, <a href="https://publications.waset.org/abstracts/search?q=neural%20networks" title=" neural networks"> neural networks</a> </p> <a href="https://publications.waset.org/abstracts/185203/parallel-computing-offloading-matrix-multiplication-to-gpu" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/185203.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">58</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">2097</span> Optimizing Parallel Computing Systems: A Java-Based Approach to Modeling and Performance Analysis</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Maher%20Ali%20Rusho">Maher Ali Rusho</a>, <a href="https://publications.waset.org/abstracts/search?q=Sudipta%20Halder"> Sudipta Halder</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The purpose of the study is to develop optimal solutions for models of parallel computing systems using the Java language. During the study, programmes were written for the examined models of parallel computing systems. The result of the parallel sorting code is the output of a sorted array of random numbers. When processing data in parallel, the time spent on processing and the first elements of the list of squared numbers are displayed. When processing requests asynchronously, processing completion messages are displayed for each task with a slight delay. The main results include the development of optimisation methods for algorithms and processes, such as the division of tasks into subtasks, the use of non-blocking algorithms, effective memory management, and load balancing, as well as the construction of diagrams and comparison of these methods by characteristics, including descriptions, implementation examples, and advantages. In addition, various specialised libraries were analysed to improve the performance and scalability of the models. The results of the work performed showed a substantial improvement in response time, bandwidth, and resource efficiency in parallel computing systems. Scalability and load analysis assessments were conducted, demonstrating how the system responds to an increase in data volume or the number of threads. Profiling tools were used to analyse performance in detail and identify bottlenecks in models, which improved the architecture and implementation of parallel computing systems. The obtained results emphasise the importance of choosing the right methods and tools for optimising parallel computing systems, which can substantially improve their performance and efficiency. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=algorithm%20optimisation" title="algorithm optimisation">algorithm optimisation</a>, <a href="https://publications.waset.org/abstracts/search?q=memory%20management" title=" memory management"> memory management</a>, <a href="https://publications.waset.org/abstracts/search?q=load%20balancing" title=" load balancing"> load balancing</a>, <a href="https://publications.waset.org/abstracts/search?q=performance%20profiling" title=" performance profiling"> performance profiling</a>, <a href="https://publications.waset.org/abstracts/search?q=asynchronous%20programming." title=" asynchronous programming."> asynchronous programming.</a> </p> <a href="https://publications.waset.org/abstracts/192978/optimizing-parallel-computing-systems-a-java-based-approach-to-modeling-and-performance-analysis" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/192978.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">12</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">2096</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">2095</span> Parallel Random Number Generation for the Modern Supercomputer Architectures</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Roman%20Snytsar">Roman Snytsar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Pseudo-random numbers are often used in scientific computing such as the Monte Carlo Simulations or the Quantum Inspired Optimization. Requirements for a parallel random number generator running in the modern multi-core vector environment are more stringent than those for sequential random number generators. As well as passing the usual quality tests, the output of the parallel random number generator must be verifiable and reproducible throughout the concurrent execution. We propose a family of vectorized Permuted Congruential Generators. Implementations are available for multiple modern vector modern computer architectures. Besides demonstrating good single core performance, the generators scale easily across many processor cores and multiple distributed nodes. We provide performance and parallel speedup analysis and comparisons between the implementations. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=pseudo-random%20numbers" title="pseudo-random numbers">pseudo-random numbers</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20optimization" title=" quantum optimization"> quantum optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=SIMD" title=" SIMD"> SIMD</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20computing" title=" parallel computing"> parallel computing</a> </p> <a href="https://publications.waset.org/abstracts/152951/parallel-random-number-generation-for-the-modern-supercomputer-architectures" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/152951.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">120</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">2094</span> A New Distributed Computing Environment Based On Mobile Agents for Massively Parallel Applications</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Fat%C3%A9ma%20Zahra%20Benchara">Fat茅ma Zahra Benchara</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohamed%20Youssfi"> Mohamed Youssfi</a>, <a href="https://publications.waset.org/abstracts/search?q=Omar%20Bouattane"> Omar Bouattane</a>, <a href="https://publications.waset.org/abstracts/search?q=Hassan%20Ouajji"> Hassan Ouajji</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohamed%20Ouadi%20Bensalah"> Mohamed Ouadi Bensalah</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we propose a new distributed environment for High Performance Computing (HPC) based on mobile agents. It allows us to perform parallel programs execution as distributed one over a flexible grid constituted by a cooperative mobile agent team works. The distributed program to be performed is encapsulated on team leader agent which deploys its team workers as Agent Virtual Processing Unit (AVPU). Each AVPU is asked to perform its assigned tasks and provides the computational results which make the data and team works tasks management difficult for the team leader agent and that influence the performance computing. In this work we focused on the implementation of the Mobile Provider Agent (MPA) in order to manage the distribution of data and instructions and to ensure a load balancing model. It grants also some interesting mechanisms to manage the others computing challenges thanks to the mobile agents several skills. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=image%20processing" title="image processing">image processing</a>, <a href="https://publications.waset.org/abstracts/search?q=distributed%20environment" title=" distributed environment"> distributed environment</a>, <a href="https://publications.waset.org/abstracts/search?q=mobile%20agents" title=" mobile agents"> mobile agents</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20and%20distributed%20computing" title=" parallel and distributed computing"> parallel and distributed computing</a> </p> <a href="https://publications.waset.org/abstracts/24158/a-new-distributed-computing-environment-based-on-mobile-agents-for-massively-parallel-applications" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/24158.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">409</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">2093</span> Collision Detection Algorithm Based on Data Parallelism</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Zhen%20Peng">Zhen Peng</a>, <a href="https://publications.waset.org/abstracts/search?q=Baifeng%20Wu"> Baifeng Wu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Modern computing technology enters the era of parallel computing with the trend of sustainable and scalable parallelism. Single Instruction Multiple Data (SIMD) is an important way to go along with the trend. It is able to gather more and more computing ability by increasing the number of processor cores without the need of modifying the program. Meanwhile, in the field of scientific computing and engineering design, many computation intensive applications are facing the challenge of increasingly large amount of data. Data parallel computing will be an important way to further improve the performance of these applications. In this paper, we take the accurate collision detection in building information modeling as an example. We demonstrate a model for constructing a data parallel algorithm. According to the model, a complex object is decomposed into the sets of simple objects; collision detection among complex objects is converted into those among simple objects. The resulting algorithm is a typical SIMD algorithm, and its advantages in parallelism and scalability is unparalleled in respect to the traditional algorithms. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=data%20parallelism" title="data parallelism">data parallelism</a>, <a href="https://publications.waset.org/abstracts/search?q=collision%20detection" title=" collision detection"> collision detection</a>, <a href="https://publications.waset.org/abstracts/search?q=single%20instruction%20multiple%20data" title=" single instruction multiple data"> single instruction multiple data</a>, <a href="https://publications.waset.org/abstracts/search?q=building%20information%20modeling" title=" building information modeling"> building information modeling</a>, <a href="https://publications.waset.org/abstracts/search?q=continuous%20scalability" title=" continuous scalability"> continuous scalability</a> </p> <a href="https://publications.waset.org/abstracts/65675/collision-detection-algorithm-based-on-data-parallelism" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/65675.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">289</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">2092</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">2091</span> Parallel Computation of the Covariance-Matrix</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Claude%20Tadonki">Claude Tadonki</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We address the issues related to the computation of the covariance matrix. This matrix is likely to be ill conditioned following its canonical expression, thus consequently raises serious numerical issues. The underlying linear system, which therefore should be solved by means of iterative approaches, becomes computationally challenging. A huge number of iterations is expected in order to reach an acceptable level of convergence, necessary to meet the required accuracy of the computation. In addition, this linear system needs to be solved at each iteration following the general form of the covariance matrix. Putting all together, its comes that we need to compute as fast as possible the associated matrix-vector product. This is our purpose in the work, where we consider and discuss skillful formulations of the problem, then propose a parallel implementation of the matrix-vector product involved. Numerical and performance oriented discussions are provided based on experimental evaluations. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=covariance-matrix" title="covariance-matrix">covariance-matrix</a>, <a href="https://publications.waset.org/abstracts/search?q=multicore" title=" multicore"> multicore</a>, <a href="https://publications.waset.org/abstracts/search?q=numerical%20computing" title=" numerical computing"> numerical computing</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20computing" title=" parallel computing"> parallel computing</a> </p> <a href="https://publications.waset.org/abstracts/59579/parallel-computation-of-the-covariance-matrix" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/59579.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">312</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">2090</span> Grid Computing for Multi-Objective Optimization Problems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Aouaouche%20Elmaouhab">Aouaouche Elmaouhab</a>, <a href="https://publications.waset.org/abstracts/search?q=Hassina%20Beggar"> Hassina Beggar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Solving multi-objective discrete optimization applications has always been limited by the resources of one machine: By computing power or by memory, most often both. To speed up the calculations, the grid computing represents a primary solution for the treatment of these applications through the parallelization of these resolution methods. In this work, we are interested in the study of some methods for solving multiple objective integer linear programming problem based on Branch-and-Bound and the study of grid computing technology. This study allowed us to propose an implementation of the method of Abbas and Al on the grid by reducing the execution time. To enhance our contribution, the main results are presented. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=multi-objective%20optimization" title="multi-objective optimization">multi-objective optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=integer%20linear%20programming" title=" integer linear programming"> integer linear programming</a>, <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=parallel%20computing" title=" parallel computing"> parallel computing</a> </p> <a href="https://publications.waset.org/abstracts/31941/grid-computing-for-multi-objective-optimization-problems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/31941.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">485</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">2089</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">2088</span> Performance Evaluation of Parallel Surface Modeling and Generation on Actual and Virtual Multicore Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Nyeng%20P.%20Gyang">Nyeng P. Gyang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Even though past, current and future trends suggest that multicore and cloud computing systems are increasingly prevalent/ubiquitous, this class of parallel systems is nonetheless underutilized, in general, and barely used for research on employing parallel Delaunay triangulation for parallel surface modeling and generation, in particular. The performances, of actual/physical and virtual/cloud multicore systems/machines, at executing various algorithms, which implement various parallelization strategies of the incremental insertion technique of the Delaunay triangulation algorithm, were evaluated. <em>T</em>-tests were run on the data collected, in order to determine whether various performance metrics differences (including execution time, speedup and efficiency) were statistically significant. Results show that the actual machine is approximately twice faster than the virtual machine at executing the same programs for the various parallelization strategies. Results, which furnish the scalability behaviors of the various parallelization strategies, also show that some of the differences between the performances of these systems, during different runs of the algorithms on the systems, were statistically significant. A few pseudo superlinear speedup results, which were computed from the raw data collected, are not true superlinear speedup values. These pseudo superlinear speedup values, which arise as a result of one way of computing speedups, disappear and give way to asymmetric speedups, which are the accurate kind of speedups that occur in the experiments performed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cloud%20computing%20systems" title="cloud computing systems">cloud computing systems</a>, <a href="https://publications.waset.org/abstracts/search?q=multicore%20systems" title=" multicore systems"> multicore systems</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20Delaunay%20triangulation" title=" parallel Delaunay triangulation"> parallel Delaunay triangulation</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20surface%20modeling%20and%20generation" title=" parallel surface modeling and generation"> parallel surface modeling and generation</a> </p> <a href="https://publications.waset.org/abstracts/80808/performance-evaluation-of-parallel-surface-modeling-and-generation-on-actual-and-virtual-multicore-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/80808.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">206</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">2087</span> A Survey on Internet of Things and Fog Computing as a Platform for Internet of Things</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Samira%20Kalantary">Samira Kalantary</a>, <a href="https://publications.waset.org/abstracts/search?q=Sara%20Taghipour"> Sara Taghipour</a>, <a href="https://publications.waset.org/abstracts/search?q=Mansoure%20Ghias%20Abadi"> Mansoure Ghias Abadi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The Internet of Things (IOT) is a technological revolution that represents the future of computing and communications. IOT is the convergence of Internet with RFID, NFC, Sensor, and smart objects. Fog Computing is the natural platform for IOT. At present, the IOT as a new network communication technology has rapidly shifted from concept to application under fog computing virtual storage computing platform. In this paper, we describe everything about IOT and difference between cloud computing and fog computing. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cloud%20computing" title="cloud computing">cloud computing</a>, <a href="https://publications.waset.org/abstracts/search?q=fog%20computing" title=" fog computing"> fog computing</a>, <a href="https://publications.waset.org/abstracts/search?q=Internet%20of%20Things%20%28IoT%29" title=" Internet of Things (IoT)"> Internet of Things (IoT)</a>, <a href="https://publications.waset.org/abstracts/search?q=IOT%20application" title=" IOT application"> IOT application</a> </p> <a href="https://publications.waset.org/abstracts/30670/a-survey-on-internet-of-things-and-fog-computing-as-a-platform-for-internet-of-things" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/30670.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">584</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">2086</span> A Genetic Algorithm for the Load Balance of Parallel Computational Fluid Dynamics Computation with Multi-Block Structured Mesh</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Chunye%20Gong">Chunye Gong</a>, <a href="https://publications.waset.org/abstracts/search?q=Ming%20Tie"> Ming Tie</a>, <a href="https://publications.waset.org/abstracts/search?q=Jie%20Liu"> Jie Liu</a>, <a href="https://publications.waset.org/abstracts/search?q=Weimin%20Bao"> Weimin Bao</a>, <a href="https://publications.waset.org/abstracts/search?q=Xinbiao%20Gan"> Xinbiao Gan</a>, <a href="https://publications.waset.org/abstracts/search?q=Shengguo%20Li"> Shengguo Li</a>, <a href="https://publications.waset.org/abstracts/search?q=Bo%20Yang"> Bo Yang</a>, <a href="https://publications.waset.org/abstracts/search?q=Xuguang%20Chen"> Xuguang Chen</a>, <a href="https://publications.waset.org/abstracts/search?q=Tiaojie%20Xiao"> Tiaojie Xiao</a>, <a href="https://publications.waset.org/abstracts/search?q=Yang%20Sun"> Yang Sun</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Large-scale CFD simulation relies on high-performance parallel computing, and the load balance is the key role which affects the parallel efficiency. This paper focuses on the load-balancing problem of parallel CFD simulation with structured mesh. A mathematical model for this load-balancing problem is presented. The genetic algorithm, fitness computing, two-level code are designed. Optimal selector, robust operator, and local optimization operator are designed. The properties of the presented genetic algorithm are discussed in-depth. The effects of optimal selector, robust operator, and local optimization operator are proved by experiments. The experimental results of different test sets, DLR-F4, and aircraft design applications show the presented load-balancing algorithm is robust, quickly converged, and is useful in real engineering problems. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=genetic%20algorithm" title="genetic algorithm">genetic algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=load-balancing%20algorithm" title=" load-balancing algorithm"> load-balancing algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=optimal%20variation" title=" optimal variation"> optimal variation</a>, <a href="https://publications.waset.org/abstracts/search?q=local%20optimization" title=" local optimization"> local optimization</a> </p> <a href="https://publications.waset.org/abstracts/131281/a-genetic-algorithm-for-the-load-balance-of-parallel-computational-fluid-dynamics-computation-with-multi-block-structured-mesh" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/131281.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">183</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">2085</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">576</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">2084</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">2083</span> GPU Accelerated Fractal Image Compression for Medical Imaging in Parallel Computing Platform</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Md.%20Enamul%20Haque">Md. Enamul Haque</a>, <a href="https://publications.waset.org/abstracts/search?q=Abdullah%20Al%20Kaisan"> Abdullah Al Kaisan</a>, <a href="https://publications.waset.org/abstracts/search?q=Mahmudur%20R.%20Saniat"> Mahmudur R. Saniat</a>, <a href="https://publications.waset.org/abstracts/search?q=Aminur%20Rahman"> Aminur Rahman</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we have implemented both sequential and parallel version of fractal image compression algorithms using CUDA (Compute Unified Device Architecture) programming model for parallelizing the program in Graphics Processing Unit for medical images, as they are highly similar within the image itself. There is several improvements in the implementation of the algorithm as well. Fractal image compression is based on the self similarity of an image, meaning an image having similarity in majority of the regions. We take this opportunity to implement the compression algorithm and monitor the effect of it using both parallel and sequential implementation. Fractal compression has the property of high compression rate and the dimensionless scheme. Compression scheme for fractal image is of two kinds, one is encoding and another is decoding. Encoding is very much computational expensive. On the other hand decoding is less computational. The application of fractal compression to medical images would allow obtaining much higher compression ratios. While the fractal magnification an inseparable feature of the fractal compression would be very useful in presenting the reconstructed image in a highly readable form. However, like all irreversible methods, the fractal compression is connected with the problem of information loss, which is especially troublesome in the medical imaging. A very time consuming encoding process, which can last even several hours, is another bothersome drawback of the fractal compression. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=accelerated%20GPU" title="accelerated GPU">accelerated GPU</a>, <a href="https://publications.waset.org/abstracts/search?q=CUDA" title=" CUDA"> CUDA</a>, <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=fractal%20image%20compression" title=" fractal image compression"> fractal image compression</a> </p> <a href="https://publications.waset.org/abstracts/5645/gpu-accelerated-fractal-image-compression-for-medical-imaging-in-parallel-computing-platform" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/5645.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">335</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">2082</span> Pushing the Boundary of Parallel Tractability for Ontology Materialization via Boolean Circuits</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Zhangquan%20Zhou">Zhangquan Zhou</a>, <a href="https://publications.waset.org/abstracts/search?q=Guilin%20Qi"> Guilin Qi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Materialization is an important reasoning service for applications built on the Web Ontology Language (OWL). To make materialization efficient in practice, current research focuses on deciding tractability of an ontology language and designing parallel reasoning algorithms. However, some well-known large-scale ontologies, such as YAGO, have been shown to have good performance for parallel reasoning, but they are expressed in ontology languages that are not parallelly tractable, i.e., the reasoning is inherently sequential in the worst case. This motivates us to study the problem of parallel tractability of ontology materialization from a theoretical perspective. That is we aim to identify the ontologies for which materialization is parallelly tractable, i.e., in the NC complexity. Since the NC complexity is defined based on Boolean circuit that is widely used to investigate parallel computing problems, we first transform the problem of materialization to evaluation of Boolean circuits, and then study the problem of parallel tractability based on circuits. In this work, we focus on datalog rewritable ontology languages. We use Boolean circuits to identify two classes of datalog rewritable ontologies (called parallelly tractable classes) such that materialization over them is parallelly tractable. We further investigate the parallel tractability of materialization of a datalog rewritable OWL fragment DHL (Description Horn Logic). Based on the above results, we analyze real-world datasets and show that many ontologies expressed in DHL belong to the parallelly tractable classes. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=ontology%20materialization" title="ontology materialization">ontology materialization</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20reasoning" title=" parallel reasoning"> parallel reasoning</a>, <a href="https://publications.waset.org/abstracts/search?q=datalog" title=" datalog"> datalog</a>, <a href="https://publications.waset.org/abstracts/search?q=Boolean%20circuit" title=" Boolean circuit"> Boolean circuit</a> </p> <a href="https://publications.waset.org/abstracts/57402/pushing-the-boundary-of-parallel-tractability-for-ontology-materialization-via-boolean-circuits" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/57402.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">271</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">2081</span> Fog Computing- Network Based Computing</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Navaneeth%20Krishnan">Navaneeth Krishnan</a>, <a href="https://publications.waset.org/abstracts/search?q=Chandan%20N.%20Bhagwat"> Chandan N. Bhagwat</a>, <a href="https://publications.waset.org/abstracts/search?q=Aparajit%20P.%20Utpat"> Aparajit P. Utpat</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Cloud Computing provides us a means to upload data and use applications over the internet. As the number of devices connecting to the cloud grows, there is undue pressure on the cloud infrastructure. Fog computing or Network Based Computing or Edge Computing allows to move a part of the processing in the cloud to the network devices present along the node to the cloud. Therefore the nodes connected to the cloud have a better response time. This paper proposes a method of moving the computation from the cloud to the network by introducing an android like appstore on the networking devices. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cloud%20computing" title="cloud computing">cloud computing</a>, <a href="https://publications.waset.org/abstracts/search?q=fog%20computing" title=" fog computing"> fog computing</a>, <a href="https://publications.waset.org/abstracts/search?q=network%20devices" title=" network devices"> network devices</a>, <a href="https://publications.waset.org/abstracts/search?q=appstore" title=" appstore"> appstore</a> </p> <a href="https://publications.waset.org/abstracts/18550/fog-computing-network-based-computing" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/18550.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">387</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">2080</span> Effect of Cloud Computing on Enterprises</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Amir%20Rashid">Amir Rashid</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Today is the world of innovations where everyone is looking for a change. Organizations are now looking toward virtualization in order to minimize their computing cost. Cloud Computing has also introduced itself by the means of reducing computing cost. It offers different approach to make computing better by improving utilization and reducing infrastructure and administrative costs. Cloud Computing is basically the amalgamation of Utility Computing and SaaS (Software as a Service). Cloud Computing is quite new to organizations as it is still at its deploying stage. Due to this reason, organizations are not confident whether to adopt it or not. This thesis investigates the problem for organization concerning the security and cost issues. Benefits and drawbacks are being highlighted which organizations can have or suffer in order to adopt Cloud Computing. In Conclusion, Cloud Computing is a better option available for small and medium organizations with a comparison to large companies both in terms of data security and cost. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cloud%20computing" title="cloud computing">cloud computing</a>, <a href="https://publications.waset.org/abstracts/search?q=security" title=" security"> security</a>, <a href="https://publications.waset.org/abstracts/search?q=cost" title=" cost"> cost</a>, <a href="https://publications.waset.org/abstracts/search?q=elasticity" title=" elasticity"> elasticity</a>, <a href="https://publications.waset.org/abstracts/search?q=PaaS" title=" PaaS"> PaaS</a>, <a href="https://publications.waset.org/abstracts/search?q=IaaS" title=" IaaS"> IaaS</a>, <a href="https://publications.waset.org/abstracts/search?q=SaaS" title=" SaaS"> SaaS</a> </p> <a href="https://publications.waset.org/abstracts/46177/effect-of-cloud-computing-on-enterprises" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/46177.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">340</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">2079</span> Cloud Computing in Data Mining: A Technical Survey</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ghaemi%20Reza">Ghaemi Reza</a>, <a href="https://publications.waset.org/abstracts/search?q=Abdollahi%20Hamid"> Abdollahi Hamid</a>, <a href="https://publications.waset.org/abstracts/search?q=Dashti%20Elham"> Dashti Elham</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Cloud computing poses a diversity of challenges in data mining operation arising out of the dynamic structure of data distribution as against the use of typical database scenarios in conventional architecture. Due to immense number of users seeking data on daily basis, there is a serious security concerns to cloud providers as well as data providers who put their data on the cloud computing environment. Big data analytics use compute intensive data mining algorithms (Hidden markov, MapReduce parallel programming, Mahot Project, Hadoop distributed file system, K-Means and KMediod, Apriori) that require efficient high performance processors to produce timely results. Data mining algorithms to solve or optimize the model parameters. The challenges that operation has to encounter is the successful transactions to be established with the existing virtual machine environment and the databases to be kept under the control. Several factors have led to the distributed data mining from normal or centralized mining. The approach is as a SaaS which uses multi-agent systems for implementing the different tasks of system. There are still some problems of data mining based on cloud computing, including design and selection of data mining algorithms. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cloud%20computing" title="cloud computing">cloud computing</a>, <a href="https://publications.waset.org/abstracts/search?q=data%20mining" title=" data mining"> data mining</a>, <a href="https://publications.waset.org/abstracts/search?q=computing%20models" title=" computing models"> computing models</a>, <a href="https://publications.waset.org/abstracts/search?q=cloud%20services" title=" cloud services"> cloud services</a> </p> <a href="https://publications.waset.org/abstracts/17331/cloud-computing-in-data-mining-a-technical-survey" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/17331.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">479</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">2078</span> Load Balancing Algorithms for SIP Server Clusters in Cloud Computing</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Tanmay%20Raj">Tanmay Raj</a>, <a href="https://publications.waset.org/abstracts/search?q=Vedika%20Gupta"> Vedika Gupta</a> </p> <p class="card-text"><strong>Abstract:</strong></p> For its groundbreaking and substantial power, cloud computing is today鈥檚 most popular breakthrough. It is a sort of Internet-based computing that allows users to request and receive numerous services in a cost-effective manner. Virtualization, grid computing, and utility computing are the most widely employed emerging technologies in cloud computing, making it the most powerful. However, cloud computing still has a number of key challenges, such as security, load balancing, and non-critical failure adaption, to name a few. The massive growth of cloud computing will put an undue strain on servers. As a result, network performance will deteriorate. A good load balancing adjustment can make cloud computing more productive and in- crease client fulfillment execution. Load balancing is an important part of cloud computing because it prevents certain nodes from being overwhelmed while others are idle or have little work to perform. Response time, cost, throughput, performance, and resource usage are all parameters that may be improved using load balancing. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cloud%20computing" title="cloud computing">cloud computing</a>, <a href="https://publications.waset.org/abstracts/search?q=load%20balancing" title=" load balancing"> load balancing</a>, <a href="https://publications.waset.org/abstracts/search?q=computing" title=" computing"> computing</a>, <a href="https://publications.waset.org/abstracts/search?q=SIP%20server%20clusters" title=" SIP server clusters"> SIP server clusters</a> </p> <a href="https://publications.waset.org/abstracts/150361/load-balancing-algorithms-for-sip-server-clusters-in-cloud-computing" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/150361.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">123</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">2077</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">348</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">2076</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">2075</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">2074</span> Model and Algorithm for Dynamic Wireless Electric Vehicle Charging Network Design</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Trung%20Hieu%20Tran">Trung Hieu Tran</a>, <a href="https://publications.waset.org/abstracts/search?q=Jesse%20O%27Hanley"> Jesse O'Hanley</a>, <a href="https://publications.waset.org/abstracts/search?q=Russell%20Fowler"> Russell Fowler</a> </p> <p class="card-text"><strong>Abstract:</strong></p> When in-wheel wireless charging technology for electric vehicles becomes mature, a need for such integrated charging stations network development is essential. In this paper, we thus investigate the optimisation problem of in-wheel wireless electric vehicle charging network design. A mixed-integer linear programming model is formulated to solve into optimality the problem. In addition, a meta-heuristic algorithm is proposed for efficiently solving large-sized instances within a reasonable computation time. A parallel computing strategy is integrated into the algorithm to speed up its computation time. Experimental results carried out on the benchmark instances show that our model and algorithm can find the optimal solutions and their potential for practical applications. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=electric%20vehicle" title="electric vehicle">electric vehicle</a>, <a href="https://publications.waset.org/abstracts/search?q=wireless%20charging%20station" title=" wireless charging station"> wireless charging station</a>, <a href="https://publications.waset.org/abstracts/search?q=mathematical%20programming" title=" mathematical programming"> mathematical programming</a>, <a href="https://publications.waset.org/abstracts/search?q=meta-heuristic%20algorithm" title=" meta-heuristic algorithm"> meta-heuristic algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20computing" title=" parallel computing"> parallel computing</a> </p> <a href="https://publications.waset.org/abstracts/159397/model-and-algorithm-for-dynamic-wireless-electric-vehicle-charging-network-design" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/159397.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">79</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">2073</span> Analyzing the Factors that Cause Parallel Performance Degradation in Parallel Graph-Based Computations Using Graph500</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mustafa%20Elfituri">Mustafa Elfituri</a>, <a href="https://publications.waset.org/abstracts/search?q=Jonathan%20Cook"> Jonathan Cook</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Recently, graph-based computations have become more important in large-scale scientific computing as they can provide a methodology to model many types of relations between independent objects. They are being actively used in fields as varied as biology, social networks, cybersecurity, and computer networks. At the same time, graph problems have some properties such as irregularity and poor locality that make their performance different than regular applications performance. Therefore, parallelizing graph algorithms is a hard and challenging task. Initial evidence is that standard computer architectures do not perform very well on graph algorithms. Little is known exactly what causes this. The Graph500 benchmark is a representative application for parallel graph-based computations, which have highly irregular data access and are driven more by traversing connected data than by computation. In this paper, we present results from analyzing the performance of various example implementations of Graph500, including a shared memory (OpenMP) version, a distributed (MPI) version, and a hybrid version. We measured and analyzed all the factors that affect its performance in order to identify possible changes that would improve its performance. Results are discussed in relation to what factors contribute to performance degradation. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=graph%20computation" title="graph computation">graph computation</a>, <a href="https://publications.waset.org/abstracts/search?q=graph500%20benchmark" title=" graph500 benchmark"> graph500 benchmark</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20architectures" title=" parallel architectures"> parallel architectures</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=workload%20characterization." title=" workload characterization."> workload characterization.</a> </p> <a href="https://publications.waset.org/abstracts/133666/analyzing-the-factors-that-cause-parallel-performance-degradation-in-parallel-graph-based-computations-using-graph500" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/133666.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">147</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">2072</span> Design and Implementation of Security Middleware for Data Warehouse Signature, Framework</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mayada%20Al%20Meghari">Mayada Al Meghari</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Recently, grid middlewares have provided large integrated use of network resources as the shared data and the CPU to become a virtual supercomputer. In this work, we present the design and implementation of the middleware for Data Warehouse Signature, DWS Framework. The aim of using the middleware in our DWS framework is to achieve the high performance by the parallel computing. This middleware is developed on Alchemi.Net framework to increase the security among the network nodes through the authentication and group-key distribution model. This model achieves the key security and prevents any intermediate attacks in the middleware. This paper presents the flow process structures of the middleware design. In addition, the paper ensures the implementation of security for DWS middleware enhancement with the authentication and group-key distribution model. Finally, from the analysis of other middleware approaches, the developed middleware of DWS framework is the optimal solution of a complete covering of security issues. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=middleware" title="middleware">middleware</a>, <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=data%20warehouse" title=" data warehouse"> data warehouse</a>, <a href="https://publications.waset.org/abstracts/search?q=security" title=" security"> security</a>, <a href="https://publications.waset.org/abstracts/search?q=group-key" title=" group-key"> group-key</a>, <a href="https://publications.waset.org/abstracts/search?q=high%20performance" title=" high performance"> high performance</a> </p> <a href="https://publications.waset.org/abstracts/148313/design-and-implementation-of-security-middleware-for-data-warehouse-signature-framework" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/148313.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">119</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">2071</span> Key Technologies and Evolution Strategies for Computing Force Bearer Network</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Zhaojunfeng">Zhaojunfeng</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Driven by the national policy of "East Data and Western Calculation", the computing first network will attract a new wave of development. As the foundation of the development of the computing first network, the computing force bearer network has become the key direction of technology research and development in the industry. This article will analyze typical computing force application scenarios and bearing requirements and sort out the SLA indicators of computing force applications. On this basis, this article carries out research and discussion on the key technologies of computing force bearer network in a slice packet network, and finally, gives evolution policy for SPN computing force bearer network to support the development of SPN computing force bearer network technology and network deployment. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=component-computing%20force%20bearing" title="component-computing force bearing">component-computing force bearing</a>, <a href="https://publications.waset.org/abstracts/search?q=bearing%20requirements%20of%20computing%20force%20application" title=" bearing requirements of computing force application"> bearing requirements of computing force application</a>, <a href="https://publications.waset.org/abstracts/search?q=dual-SLA%20indicators%20for%20computing%20force%20applications" title=" dual-SLA indicators for computing force applications"> dual-SLA indicators for computing force applications</a>, <a href="https://publications.waset.org/abstracts/search?q=SRv6" title=" SRv6"> SRv6</a>, <a href="https://publications.waset.org/abstracts/search?q=evolution%20strategies" title=" evolution strategies"> evolution strategies</a> </p> <a href="https://publications.waset.org/abstracts/155006/key-technologies-and-evolution-strategies-for-computing-force-bearer-network" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/155006.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">130</span> </span> </div> </div> <ul class="pagination"> <li class="page-item disabled"><span class="page-link">&lsaquo;</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%20computing&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=parallel%20computing&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=parallel%20computing&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=parallel%20computing&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=parallel%20computing&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=parallel%20computing&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=parallel%20computing&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=parallel%20computing&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=parallel%20computing&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%20computing&page=69">69</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=parallel%20computing&page=70">70</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=parallel%20computing&page=2" rel="next">&rsaquo;</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>