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>   <script> var _paq = window._paq = window._paq || []; /* tracker methods like "setCustomDimension" should be called before "trackPageView" */ _paq.push(['trackPageView']); _paq.push(['enableLinkTracking']); (function() { var u="//matomo.waset.org/"; _paq.push(['setTrackerUrl', u+'matomo.php']); _paq.push(['setSiteId', '2']); var d=document, g=d.createElement('script'), s=d.getElementsByTagName('script')[0]; g.async=true; g.src=u+'matomo.js'; s.parentNode.insertBefore(g,s); })(); </script>  <title>Search results for: speedup</title> <meta name="description" content="Search results for: speedup"> <meta name="keywords" content="speedup"> <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="speedup" 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 2025/2026/2027">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="speedup"> <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> 18</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: speedup</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">18</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">618</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">17</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">212</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">16</span> SISSLE in Consensus-Based Ripple: Some Improvements in Speed, Security, Last Mile Connectivity and Ease of Use</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mayank%20Mundhra">Mayank Mundhra</a>, <a href="https://publications.waset.org/abstracts/search?q=Chester%20Rebeiro"> Chester Rebeiro</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Cryptocurrencies are rapidly finding wide application in areas such as Real Time Gross Settlements and Payments Systems. Ripple is a cryptocurrency that has gained prominence with banks and payment providers. It solves the Byzantine General’s Problem with its Ripple Protocol Consensus Algorithm (RPCA), where each server maintains a list of servers, called Unique Node List (UNL) that represents the network for the server, and will not collectively defraud it. The server believes that the network has come to a consensus when members of the UNL come to a consensus on a transaction. In this paper we improve Ripple to achieve better speed, security, last mile connectivity and ease of use. We implement guidelines and automated systems for building and maintaining UNLs for resilience, robustness, improved security, and efficient information propagation. We enhance the system so as to ensure that each server receives information from across the whole network rather than just from the UNL members. We also introduce the paradigm of UNL overlap as a function of information propagation and the trust a server assigns to its own UNL. Our design not only reduces vulnerabilities such as eclipse attacks, but also makes it easier to identify malicious behaviour and entities attempting to fraudulently Double Spend or stall the system. We provide experimental evidence of the benefits of our approach over the current Ripple scheme. We observe ≥ 4.97x and 98.22x in speedup and success rate for information propagation respectively, and ≥ 3.16x and 51.70x in speedup and success rate in consensus. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ripple" title="Ripple">Ripple</a>, <a href="https://publications.waset.org/abstracts/search?q=Kelips" title=" Kelips"> Kelips</a>, <a href="https://publications.waset.org/abstracts/search?q=unique%20node%20list" title=" unique node list"> unique node list</a>, <a href="https://publications.waset.org/abstracts/search?q=consensus" title=" consensus"> consensus</a>, <a href="https://publications.waset.org/abstracts/search?q=information%20propagation" title=" information propagation"> information propagation</a> </p> <a href="https://publications.waset.org/abstracts/130100/sissle-in-consensus-based-ripple-some-improvements-in-speed-security-last-mile-connectivity-and-ease-of-use" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/130100.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">155</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">15</span> A Sub-Scalar Approach to the MIPS Architecture</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kumar%20Sambhav%20Pandey">Kumar Sambhav Pandey</a>, <a href="https://publications.waset.org/abstracts/search?q=Anamika%20Singh"> Anamika Singh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The continuous researches in the field of computer architecture basically aims at accelerating the computational speed and to gain enhanced performance. In this era, the superscalar, sub-scalar concept has not gained enough attention for improving the computation performance. In this paper, we have presented a sub-scalar approach to utilize the parallelism present with in the data while processing. The main idea is to split the data into individual smaller entities and these entities are processed with a defined known set of instructions. This sub-scalar approach to the MIPS architecture can bring out significant improvement in the computational speedup. MIPS-I is the basic design taken in consideration for the development of sub-scalar MIPS64 for increasing the instruction level parallelism (ILP) and resource utilization. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=dataword" title="dataword">dataword</a>, <a href="https://publications.waset.org/abstracts/search?q=MIPS" title=" MIPS"> MIPS</a>, <a href="https://publications.waset.org/abstracts/search?q=processor" title=" processor"> processor</a>, <a href="https://publications.waset.org/abstracts/search?q=sub-scalar" title=" sub-scalar"> sub-scalar</a> </p> <a href="https://publications.waset.org/abstracts/11673/a-sub-scalar-approach-to-the-mips-architecture" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/11673.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">550</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">14</span> CMOS Solid-State Nanopore DNA System-Level Sequencing Techniques Enhancement</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Syed%20Islam">Syed Islam</a>, <a href="https://publications.waset.org/abstracts/search?q=Yiyun%20Huang"> Yiyun Huang</a>, <a href="https://publications.waset.org/abstracts/search?q=Sebastian%20Magierowski"> Sebastian Magierowski</a>, <a href="https://publications.waset.org/abstracts/search?q=Ebrahim%20Ghafar-Zadeh"> Ebrahim Ghafar-Zadeh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents system level CMOS solid-state nanopore techniques enhancement for speedup next generation molecular recording and high throughput channels. This discussion also considers optimum number of base-pair (bp) measurements through channel as an important role to enhance potential read accuracy. Effective power consumption estimation offered suitable rangeof multi-channel configuration. Nanopore bp extraction model in statistical method could contribute higher read accuracy with longer read-length (200 < read-length). Nanopore ionic current switching with Time Multiplexing (TM) based multichannel readout system contributed hardware savings. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=DNA" title="DNA">DNA</a>, <a href="https://publications.waset.org/abstracts/search?q=nanopore" title=" nanopore"> nanopore</a>, <a href="https://publications.waset.org/abstracts/search?q=amplifier" title=" amplifier"> amplifier</a>, <a href="https://publications.waset.org/abstracts/search?q=ADC" title=" ADC"> ADC</a>, <a href="https://publications.waset.org/abstracts/search?q=multichannel" title=" multichannel"> multichannel</a> </p> <a href="https://publications.waset.org/abstracts/22700/cmos-solid-state-nanopore-dna-system-level-sequencing-techniques-enhancement" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/22700.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">457</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">13</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">29</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">12</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">126</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">11</span> Numerical Solution Speedup of the Laplace Equation Using FPGA Hardware</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Abbas%20Ebrahimi">Abbas Ebrahimi</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohammad%20Zandsalimy"> Mohammad Zandsalimy</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The main purpose of this study is to investigate the feasibility of using FPGA (Field Programmable Gate Arrays) chips as alternatives for the conventional CPUs to accelerate the numerical solution of the Laplace equation. FPGA is an integrated circuit that contains an array of logic blocks, and its architecture can be reprogrammed and reconfigured after manufacturing. Complex circuits for various applications can be designed and implemented using FPGA hardware. The reconfigurable hardware used in this paper is an SoC (System on a Chip) FPGA type that integrates both microprocessor and FPGA architectures into a single device. In the present study the Laplace equation is implemented and solved numerically on both reconfigurable hardware and CPU. The precision of results and speedups of the calculations are compared together. The computational process on FPGA, is up to 20 times faster than a conventional CPU, with the same data precision. An analytical solution is used to validate the results. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=accelerating%20numerical%20solutions" title="accelerating numerical solutions">accelerating numerical solutions</a>, <a href="https://publications.waset.org/abstracts/search?q=CFD" title=" CFD"> CFD</a>, <a href="https://publications.waset.org/abstracts/search?q=FPGA" title=" FPGA"> FPGA</a>, <a href="https://publications.waset.org/abstracts/search?q=hardware%20definition%20language" title=" hardware definition language"> hardware definition language</a>, <a href="https://publications.waset.org/abstracts/search?q=numerical%20solutions" title=" numerical solutions"> numerical solutions</a>, <a href="https://publications.waset.org/abstracts/search?q=reconfigurable%20hardware" title=" reconfigurable hardware"> reconfigurable hardware</a> </p> <a href="https://publications.waset.org/abstracts/68002/numerical-solution-speedup-of-the-laplace-equation-using-fpga-hardware" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/68002.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">388</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">10</span> Scheduling Algorithm Based on Load-Aware Queue Partitioning in Heterogeneous Multi-Core Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hong%20Kai">Hong Kai</a>, <a href="https://publications.waset.org/abstracts/search?q=Zhong%20Jun%20Jie"> Zhong Jun Jie</a>, <a href="https://publications.waset.org/abstracts/search?q=Chen%20Lin%20Qi"> Chen Lin Qi</a>, <a href="https://publications.waset.org/abstracts/search?q=Wang%20Chen%20Guang"> Wang Chen Guang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> There are inefficient global scheduling parallelism and local scheduling parallelism prone to processor starvation in current scheduling algorithms. Regarding this issue, this paper proposed a load-aware queue partitioning scheduling strategy by first allocating the queues according to the number of processor cores, calculating the load factor to specify the load queue capacity, and it assigned the awaiting nodes to the appropriate perceptual queues through the precursor nodes and the communication computation overhead. At the same time, real-time computation of the load factor could effectively prevent the processor from being starved for a long time. Experimental comparison with two classical algorithms shows that there is a certain improvement in both performance metrics of scheduling length and task speedup ratio. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=load-aware" title="load-aware">load-aware</a>, <a href="https://publications.waset.org/abstracts/search?q=scheduling%20algorithm" title=" scheduling algorithm"> scheduling algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=perceptual%20queue" title=" perceptual queue"> perceptual queue</a>, <a href="https://publications.waset.org/abstracts/search?q=heterogeneous%20multi-core" title=" heterogeneous multi-core"> heterogeneous multi-core</a> </p> <a href="https://publications.waset.org/abstracts/162110/scheduling-algorithm-based-on-load-aware-queue-partitioning-in-heterogeneous-multi-core-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/162110.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">152</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">9</span> Speedup Breadth-First Search by Graph Ordering</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Qiuyi%20Lyu">Qiuyi Lyu</a>, <a href="https://publications.waset.org/abstracts/search?q=Bin%20Gong"> Bin Gong</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Breadth-First Search(BFS) is a core graph algorithm that is widely used for graph analysis. As it is frequently used in many graph applications, improve the BFS performance is essential. In this paper, we present a graph ordering method that could reorder the graph nodes to achieve better data locality, thus, improving the BFS performance. Our method is based on an observation that the sibling relationships will dominate the cache access pattern during the BFS traversal. Therefore, we propose a frequency-based model to construct the graph order. First, we optimize the graph order according to the nodes’ visit frequency. Nodes with high visit frequency will be processed in priority. Second, we try to maximize the child nodes overlap layer by layer. As it is proved to be NP-hard, we propose a heuristic method that could greatly reduce the preprocessing overheads. We conduct extensive experiments on 16 real-world datasets. The result shows that our method could achieve comparable performance with the state-of-the-art methods while the graph ordering overheads are only about 1/15. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=breadth-first%20search" title="breadth-first search">breadth-first search</a>, <a href="https://publications.waset.org/abstracts/search?q=BFS" title=" BFS"> BFS</a>, <a href="https://publications.waset.org/abstracts/search?q=graph%20ordering" title=" graph ordering"> graph ordering</a>, <a href="https://publications.waset.org/abstracts/search?q=graph%20algorithm" title=" graph algorithm"> graph algorithm</a> </p> <a href="https://publications.waset.org/abstracts/136790/speedup-breadth-first-search-by-graph-ordering" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/136790.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">142</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">8</span> GPU Based High Speed Error Protection for Watermarked Medical Image Transmission</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Md%20Shohidul%20Islam">Md Shohidul Islam</a>, <a href="https://publications.waset.org/abstracts/search?q=Jongmyon%20Kim"> Jongmyon Kim</a>, <a href="https://publications.waset.org/abstracts/search?q=Ui-pil%20Chong"> Ui-pil Chong</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Medical image is an integral part of e-health care and e-diagnosis system. Medical image watermarking is widely used to protect patients’ information from malicious alteration and manipulation. The watermarked medical images are transmitted over the internet among patients, primary and referred physicians. The images are highly prone to corruption in the wireless transmission medium due to various noises, deflection, and refractions. Distortion in the received images leads to faulty watermark detection and inappropriate disease diagnosis. To address the issue, this paper utilizes error correction code (ECC) with (8, 4) Hamming code in an existing watermarking system. In addition, we implement the high complex ECC on a graphics processing units (GPU) to accelerate and support real-time requirement. Experimental results show that GPU achieves considerable speedup over the sequential CPU implementation, while maintaining 100% ECC efficiency. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=medical%20image%20watermarking" title="medical image watermarking">medical image watermarking</a>, <a href="https://publications.waset.org/abstracts/search?q=e-health%20system" title=" e-health system"> e-health system</a>, <a href="https://publications.waset.org/abstracts/search?q=error%20correction" title=" error correction"> error correction</a>, <a href="https://publications.waset.org/abstracts/search?q=Hamming%20code" title=" Hamming code"> Hamming code</a>, <a href="https://publications.waset.org/abstracts/search?q=GPU" title=" GPU"> GPU</a> </p> <a href="https://publications.waset.org/abstracts/5248/gpu-based-high-speed-error-protection-for-watermarked-medical-image-transmission" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/5248.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">294</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">7</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">454</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">6</span> Trimma: Trimming Metadata Storage and Latency for Hybrid Memory Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yiwei%20Li">Yiwei Li</a>, <a href="https://publications.waset.org/abstracts/search?q=Boyu%20Tian"> Boyu Tian</a>, <a href="https://publications.waset.org/abstracts/search?q=Mingyu%20Gao"> Mingyu Gao</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Hybrid main memory systems combine both performance and capacity advantages from heterogeneous memory technologies. With larger capacities, higher associativities, and finer granularities, hybrid memory systems currently exhibit significant metadata storage and lookup overheads for flexibly remapping data blocks between the two memory tiers. To alleviate the inefficiencies of existing designs, we propose Trimma, the combination of a multi-level metadata structure and an efficient metadata cache design. Trimma uses a multilevel metadata table to only track truly necessary address remap entries. The saved memory space is effectively utilized as extra DRAM cache capacity to improve performance. Trimma also uses separate formats to store the entries with non-identity and identity mappings. This improves the overall remap cache hit rate, further boosting the performance. Trimma is transparent to software and compatible with various types of hybrid memory systems. When evaluated on a representative DDR4 + NVM hybrid memory system, Trimma achieves up to 2.4× and on average 58.1% speedup benefits, compared with a state-of-the-art design that only leverages the unallocated fast memory space for caching. Trimma addresses metadata management overheads and targets future scalable large-scale hybrid memory architectures. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=memory%20system" title="memory system">memory system</a>, <a href="https://publications.waset.org/abstracts/search?q=data%20cache" title=" data cache"> data cache</a>, <a href="https://publications.waset.org/abstracts/search?q=hybrid%20memory" title=" hybrid memory"> hybrid memory</a>, <a href="https://publications.waset.org/abstracts/search?q=non-volatile%20memory" title=" non-volatile memory"> non-volatile memory</a> </p> <a href="https://publications.waset.org/abstracts/183183/trimma-trimming-metadata-storage-and-latency-for-hybrid-memory-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/183183.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">88</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">5</span> The Intersection/Union Region Computation for Drosophila Brain Images Using Encoding Schemes Based on Multi-Core CPUs</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ming-Yang%20Guo">Ming-Yang Guo</a>, <a href="https://publications.waset.org/abstracts/search?q=Cheng-Xian%20Wu"> Cheng-Xian Wu</a>, <a href="https://publications.waset.org/abstracts/search?q=Wei-Xiang%20Chen"> Wei-Xiang Chen</a>, <a href="https://publications.waset.org/abstracts/search?q=Chun-Yuan%20Lin"> Chun-Yuan Lin</a>, <a href="https://publications.waset.org/abstracts/search?q=Yen-Jen%20Lin"> Yen-Jen Lin</a>, <a href="https://publications.waset.org/abstracts/search?q=Ann-Shyn%20Chiang"> Ann-Shyn Chiang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> With more and more Drosophila Driver and Neuron images, it is an important work to find the similarity relationships among them as the functional inference. There is a general problem that how to find a Drosophila Driver image, which can cover a set of Drosophila Driver/Neuron images. In order to solve this problem, the intersection/union region for a set of images should be computed at first, then a comparison work is used to calculate the similarities between the region and other images. In this paper, three encoding schemes, namely Integer, Boolean, Decimal, are proposed to encode each image as a one-dimensional structure. Then, the intersection/union region from these images can be computed by using the compare operations, Boolean operators and lookup table method. Finally, the comparison work is done as the union region computation, and the similarity score can be calculated by the definition of Tanimoto coefficient. The above methods for the region computation are also implemented in the multi-core CPUs environment with the OpenMP. From the experimental results, in the encoding phase, the performance by the Boolean scheme is the best than that by others; in the region computation phase, the performance by Decimal is the best when the number of images is large. The speedup ratio can achieve 12 based on 16 CPUs. This work was supported by the Ministry of Science and Technology under the grant MOST 106-2221-E-182-070. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Drosophila%20driver%20image" title="Drosophila driver image">Drosophila driver image</a>, <a href="https://publications.waset.org/abstracts/search?q=Drosophila%20neuron%20images" title=" Drosophila neuron images"> Drosophila neuron images</a>, <a href="https://publications.waset.org/abstracts/search?q=intersection%2Funion%20computation" title=" intersection/union computation"> intersection/union computation</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=OpenMP" title=" OpenMP"> OpenMP</a> </p> <a href="https://publications.waset.org/abstracts/89335/the-intersectionunion-region-computation-for-drosophila-brain-images-using-encoding-schemes-based-on-multi-core-cpus" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/89335.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">245</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">4</span> Parallel Pipelined Conjugate Gradient Algorithm on Heterogeneous Platforms</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sergey%20Kopysov">Sergey Kopysov</a>, <a href="https://publications.waset.org/abstracts/search?q=Nikita%20Nedozhogin"> Nikita Nedozhogin</a>, <a href="https://publications.waset.org/abstracts/search?q=Leonid%20Tonkov"> Leonid Tonkov</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The article presents a parallel iterative solver for large sparse linear systems which can be used on a heterogeneous platform. Traditionally, the problem of solving linear systems does not scale well on multi-CPU/multi-GPUs clusters. For example, most of the attempts to implement the classical conjugate gradient method were at best counted in the same amount of time as the problem was enlarged. The paper proposes the pipelined variant of the conjugate gradient method (PCG), a formulation that is potentially better suited for hybrid CPU/GPU computing since it requires only one synchronization point per one iteration instead of two for standard CG. The standard and pipelined CG methods need the vector entries generated by the current GPU and other GPUs for matrix-vector products. So the communication between GPUs becomes a major performance bottleneck on multi GPU cluster. The article presents an approach to minimize the communications between parallel parts of algorithms. Additionally, computation and communication can be overlapped to reduce the impact of data exchange. Using the pipelined version of the CG method with one synchronization point, the possibility of asynchronous calculations and communications, load balancing between the CPU and GPU for solving the large linear systems allows for scalability. The algorithm is implemented with the combined use of technologies: MPI, OpenMP, and CUDA. We show that almost optimum speed up on 8-CPU/2GPU may be reached (relatively to a one GPU execution). The parallelized solver achieves a speedup of up to 5.49 times on 16 NVIDIA Tesla GPUs, as compared to one GPU. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=conjugate%20gradient" title="conjugate gradient">conjugate gradient</a>, <a href="https://publications.waset.org/abstracts/search?q=GPU" title=" GPU"> GPU</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=pipelined%20algorithm" title=" pipelined algorithm"> pipelined algorithm</a> </p> <a href="https://publications.waset.org/abstracts/141808/parallel-pipelined-conjugate-gradient-algorithm-on-heterogeneous-platforms" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/141808.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">168</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">3</span> Flood Modeling in Urban Area Using a Well-Balanced Discontinuous Galerkin Scheme on Unstructured Triangular Grids</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rabih%20Ghostine">Rabih Ghostine</a>, <a href="https://publications.waset.org/abstracts/search?q=Craig%20Kapfer"> Craig Kapfer</a>, <a href="https://publications.waset.org/abstracts/search?q=Viswanathan%20Kannan"> Viswanathan Kannan</a>, <a href="https://publications.waset.org/abstracts/search?q=Ibrahim%20Hoteit"> Ibrahim Hoteit</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Urban flooding resulting from a sudden release of water due to dam-break or excessive rainfall is a serious threatening environment hazard, which causes loss of human life and large economic losses. Anticipating floods before they occur could minimize human and economic losses through the implementation of appropriate protection, provision, and rescue plans. This work reports on the numerical modelling of flash flood propagation in urban areas after an excessive rainfall event or dam-break. A two-dimensional (2D) depth-averaged shallow water model is used with a refined unstructured grid of triangles for representing the urban area topography. The 2D shallow water equations are solved using a second-order well-balanced discontinuous Galerkin scheme. Theoretical test case and three flood events are described to demonstrate the potential benefits of the scheme: (i) wetting and drying in a parabolic basin (ii) flash flood over a physical model of the urbanized Toce River valley in Italy; (iii) wave propagation on the Reyran river valley in consequence of the Malpasset dam-break in 1959 (France); and (iv) dam-break flood in October 1982 at the town of Sumacarcel (Spain). The capability of the scheme is also verified against alternative models. Computational results compare well with recorded data and show that the scheme is at least as efficient as comparable second-order finite volume schemes, with notable efficiency speedup due to parallelization. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=dam-break" title="dam-break">dam-break</a>, <a href="https://publications.waset.org/abstracts/search?q=discontinuous%20Galerkin%20scheme" title=" discontinuous Galerkin scheme"> discontinuous Galerkin scheme</a>, <a href="https://publications.waset.org/abstracts/search?q=flood%20modeling" title=" flood modeling"> flood modeling</a>, <a href="https://publications.waset.org/abstracts/search?q=shallow%20water%20equations" title=" shallow water equations"> shallow water equations</a> </p> <a href="https://publications.waset.org/abstracts/99241/flood-modeling-in-urban-area-using-a-well-balanced-discontinuous-galerkin-scheme-on-unstructured-triangular-grids" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/99241.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">178</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">2</span> Solid Particles Transport and Deposition Prediction in a Turbulent Impinging Jet Using the Lattice Boltzmann Method and a Probabilistic Model on GPU</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ali%20Abdul%20Kadhim">Ali Abdul Kadhim</a>, <a href="https://publications.waset.org/abstracts/search?q=Fue%20Lien"> Fue Lien</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Solid particle distribution on an impingement surface has been simulated utilizing a graphical processing unit (GPU). In-house computational fluid dynamics (CFD) code has been developed to investigate a 3D turbulent impinging jet using the lattice Boltzmann method (LBM) in conjunction with large eddy simulation (LES) and the multiple relaxation time (MRT) models. This paper proposed an improvement in the LBM-cellular automata (LBM-CA) probabilistic method. In the current model, the fluid flow utilizes the D3Q19 lattice, while the particle model employs the D3Q27 lattice. The particle numbers are defined at the same regular LBM nodes, and transport of particles from one node to its neighboring nodes are determined in accordance with the particle bulk density and velocity by considering all the external forces. The previous models distribute particles at each time step without considering the local velocity and the number of particles at each node. The present model overcomes the deficiencies of the previous LBM-CA models and, therefore, can better capture the dynamic interaction between particles and the surrounding turbulent flow field. Despite the increasing popularity of LBM-MRT-CA model in simulating complex multiphase fluid flows, this approach is still expensive in term of memory size and computational time required to perform 3D simulations. To improve the throughput of each simulation, a single GeForce GTX TITAN X GPU is used in the present work. The CUDA parallel programming platform and the CuRAND library are utilized to form an efficient LBM-CA algorithm. The methodology was first validated against a benchmark test case involving particle deposition on a square cylinder confined in a duct. The flow was unsteady and laminar at Re=200 (Re is the Reynolds number), and simulations were conducted for different Stokes numbers. The present LBM solutions agree well with other results available in the open literature. The GPU code was then used to simulate the particle transport and deposition in a turbulent impinging jet at Re=10,000. The simulations were conducted for L/D=2,4 and 6, where L is the nozzle-to-surface distance and D is the jet diameter. The effect of changing the Stokes number on the particle deposition profile was studied at different L/D ratios. For comparative studies, another in-house serial CPU code was also developed, coupling LBM with the classical Lagrangian particle dispersion model. Agreement between results obtained with LBM-CA and LBM-Lagrangian models and the experimental data is generally good. The present GPU approach achieves a speedup ratio of about 350 against the serial code running on a single CPU. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=CUDA" title="CUDA">CUDA</a>, <a href="https://publications.waset.org/abstracts/search?q=GPU%20parallel%20programming" title=" GPU parallel programming"> GPU parallel programming</a>, <a href="https://publications.waset.org/abstracts/search?q=LES" title=" LES"> LES</a>, <a href="https://publications.waset.org/abstracts/search?q=lattice%20Boltzmann%20method" title=" lattice Boltzmann method"> lattice Boltzmann method</a>, <a href="https://publications.waset.org/abstracts/search?q=MRT" title=" MRT"> MRT</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-phase%20flow" title=" multi-phase flow"> multi-phase flow</a>, <a href="https://publications.waset.org/abstracts/search?q=probabilistic%20model" title=" probabilistic model"> probabilistic model</a> </p> <a href="https://publications.waset.org/abstracts/77795/solid-particles-transport-and-deposition-prediction-in-a-turbulent-impinging-jet-using-the-lattice-boltzmann-method-and-a-probabilistic-model-on-gpu" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/77795.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">210</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">1</span> Beyond Classical Security: The Imperative For Post-quantum Cryptography In The Space Domain</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Anupam%20Tiwari">Anupam Tiwari</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The rapid advancement of quantum computing poses significant challenges to the current cryptographic infrastructure, especially in sensitive domains like space exploration and satellite communication. As quantum computing technologies evolve, they present a unique and escalating threat to the foundational security protocols that safeguard data in the digital age, including in the space domain. This research paper explores the need for post-quantum cryptography (PQC) in the context of space operations, focusing on how quantum computers, equipped with algorithms such as Peter Shor’s and Lov Grover’s, could potentially undermine existing classical cryptographic systems. Classical cryptographic methods, which currently secure communication, data integrity, and authentication processes in space operations, rely heavily on mathematical problems that are computationally infeasible for classical computers to solve in a reasonable timeframe. However, quantum algorithms can solve these problems exponentially faster, rendering current cryptographic practices vulnerable. Shor’s algorithm, for instance, threatens the very foundation of asymmetric cryptography, particularly breaking public-key encryption systems like RSA and ECC by efficiently factoring large integers and computing discrete logarithms. Grover’s algorithm, on the other hand, offers a quadratic speedup in solving symmetric-key cryptography problems, effectively halving the security strength of these systems, making them susceptible to attacks that were previously infeasible with classical computers. The space domain, with its reliance on secure communications between satellites, ground stations, and spacecraft, faces an even more critical risk due to its unique challenges. Space systems operate in an environment where data security is paramount, as adversarial attacks could disrupt missions or endanger astronauts. Given the inherent vulnerabilities that quantum algorithms can exploit, the research proposes that the space sector must begin transitioning to post-quantum cryptographic solutions that are resistant to quantum-based attacks. The development of cryptographic protocols that can withstand quantum computational power is no longer a theoretical concern but an imminent necessity, as quantum technologies continue to develop rapidly. Furthermore, this paper emphasizes the importance of designing and deploying cryptographic systems that will not only safeguard space missions from potential quantum threats but also ensure long-term security in the event that large-scale quantum computers become available. The current cryptographic measures in place, such as RSA, ECC, and AES, will become obsolete in the quantum era, necessitating the exploration and adoption of quantum-resistant alternatives. As space missions often span several decades, proactive measures to secure these operations from quantum-enabled breaches are vital. This literature review underscores the critical need for post-quantum cryptography in the space domain to counter the threats posed by quantum computers. It also discusses the implications of Shor’s and Grover’s algorithms in breaking classical encryption systems and explores ongoing efforts to develop quantum-resistant cryptographic protocols. The research calls for accelerated efforts in the development, standardization, and implementation of PQC solutions to secure space communication infrastructure against the imminent quantum threat. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=post%20quantum%20cryptography" title="post quantum cryptography">post quantum cryptography</a>, <a href="https://publications.waset.org/abstracts/search?q=peter%20shor" title=" peter shor"> peter shor</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20threats" title=" quantum threats"> quantum threats</a>, <a href="https://publications.waset.org/abstracts/search?q=classical%20cryptography" title=" classical cryptography"> classical cryptography</a>, <a href="https://publications.waset.org/abstracts/search?q=cyber%20security%20space" title=" cyber security space"> cyber security space</a> </p> <a href="https://publications.waset.org/abstracts/198918/beyond-classical-security-the-imperative-for-post-quantum-cryptography-in-the-space-domain" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/198918.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">2</span> </span> </div> </div> </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">© 2025 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>