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: scheduling</title> <meta name="description" content="Search results for: scheduling"> <meta name="keywords" content="scheduling"> <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="scheduling" 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/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="scheduling"> <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> 302</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: scheduling</h1> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">302</span> A Survey of Job Scheduling and Resource Management in Grid Computing</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Raksha%20Sharma">Raksha Sharma</a>, <a href="https://publications.waset.org/search?q=Vishnu%20Kant%20Soni"> Vishnu Kant Soni</a>, <a href="https://publications.waset.org/search?q=Manoj%20Kumar%20Mishra"> Manoj Kumar Mishra</a>, <a href="https://publications.waset.org/search?q=Prachet%20Bhuyan"> Prachet Bhuyan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Grid computing is a form of distributed computing that involves coordinating and sharing computational power, data storage and network resources across dynamic and geographically dispersed organizations. Scheduling onto the Grid is NP-complete, so there is no best scheduling algorithm for all grid computing systems. An alternative is to select an appropriate scheduling algorithm to use in a given grid environment because of the characteristics of the tasks, machines and network connectivity. Job and resource scheduling is one of the key research area in grid computing. The goal of scheduling is to achieve highest possible system throughput and to match the application need with the available computing resources. Motivation of the survey is to encourage the amateur researcher in the field of grid computing, so that they can understand easily the concept of scheduling and can contribute in developing more efficient scheduling algorithm. This will benefit interested researchers to carry out further work in this thrust area of research. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Grid%20Computing" title="Grid Computing">Grid Computing</a>, <a href="https://publications.waset.org/search?q=Job%20Scheduling" title=" Job Scheduling"> Job Scheduling</a>, <a href="https://publications.waset.org/search?q=ResourceScheduling." title=" ResourceScheduling."> ResourceScheduling.</a> </p> <a href="https://publications.waset.org/6334/a-survey-of-job-scheduling-and-resource-management-in-grid-computing" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/6334/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/6334/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/6334/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/6334/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/6334/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/6334/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/6334/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/6334/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/6334/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/6334/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/6334.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">3410</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">301</span> Towards Developing a Self-Explanatory Scheduling System Based on a Hybrid Approach</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Jian%20Zheng">Jian Zheng</a>, <a href="https://publications.waset.org/search?q=Yoshiyasu%20Takahashi"> Yoshiyasu Takahashi</a>, <a href="https://publications.waset.org/search?q=Yuichi%20Kobayashi"> Yuichi Kobayashi</a>, <a href="https://publications.waset.org/search?q=Tatsuhiro%20Sato"> Tatsuhiro Sato</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In the study, we present a conceptual framework for developing a scheduling system that can generate self-explanatory and easy-understanding schedules. To this end, a user interface is conceived to help planners record factors that are considered crucial in scheduling, as well as internal and external sources relating to such factors. A hybrid approach combining machine learning and constraint programming is developed to generate schedules and the corresponding factors, and accordingly display them on the user interface. Effects of the proposed system on scheduling are discussed, and it is expected that scheduling efficiency and system understandability will be improved, compared with previous scheduling systems. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Constraint%20programming" title="Constraint programming">Constraint programming</a>, <a href="https://publications.waset.org/search?q=Factors%20considered%20in%20scheduling" title=" Factors considered in scheduling"> Factors considered in scheduling</a>, <a href="https://publications.waset.org/search?q=machine%20learning" title=" machine learning"> machine learning</a>, <a href="https://publications.waset.org/search?q=scheduling%20system." title=" scheduling system. "> scheduling system. </a> </p> <a href="https://publications.waset.org/10004494/towards-developing-a-self-explanatory-scheduling-system-based-on-a-hybrid-approach" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10004494/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10004494/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10004494/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10004494/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10004494/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10004494/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10004494/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10004494/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10004494/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10004494/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10004494.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">1435</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">300</span> Accrual Based Scheduling for Cloud in Single and Multi Resource System: Study of Three Techniques</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=R.%20Santhosh">R. Santhosh</a>, <a href="https://publications.waset.org/search?q=T.%20Ravichandran"> T. Ravichandran</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper evaluates the accrual based scheduling for cloud in single and multi-resource system. Numerous organizations benefit from Cloud computing by hosting their applications. The cloud model provides needed access to computing with potentially unlimited resources. Scheduling is tasks and resources mapping to a certain optimal goal principle. Scheduling, schedules tasks to virtual machines in accordance with adaptable time, in sequence under transaction logic constraints. A good scheduling algorithm improves CPU use, turnaround time, and throughput. In this paper, three realtime cloud services scheduling algorithm for single resources and multiple resources are investigated. Experimental results show Resource matching algorithm performance to be superior for both single and multi-resource scheduling when compared to benefit first scheduling, Migration, Checkpoint algorithms. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Cloud%20computing" title="Cloud computing">Cloud computing</a>, <a href="https://publications.waset.org/search?q=Scheduling" title=" Scheduling"> Scheduling</a>, <a href="https://publications.waset.org/search?q=Migration" title=" Migration"> Migration</a>, <a href="https://publications.waset.org/search?q=Checkpoint" title=" Checkpoint"> Checkpoint</a>, <a href="https://publications.waset.org/search?q=Resource%20Matching." title=" Resource Matching."> Resource Matching.</a> </p> <a href="https://publications.waset.org/10002757/accrual-based-scheduling-for-cloud-in-single-and-multi-resource-system-study-of-three-techniques" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10002757/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10002757/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10002757/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10002757/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10002757/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10002757/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10002757/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10002757/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10002757/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10002757/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10002757.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">1918</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">299</span> A New Scheduling Algorithm Based on Traffic Classification Using Imprecise Computation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Farzad%20Abtahi">Farzad Abtahi</a>, <a href="https://publications.waset.org/search?q=Sahar%20Khanmohamadi"> Sahar Khanmohamadi</a>, <a href="https://publications.waset.org/search?q=Bahram%20Sadeghi%20Bigham"> Bahram Sadeghi Bigham</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Wireless channels are characterized by more serious bursty and location-dependent errors. Many packet scheduling algorithms have been proposed for wireless networks to guarantee fairness and delay bounds. However, most existing schemes do not consider the difference of traffic natures among packet flows. This will cause the delay-weight coupling problem. In particular, serious queuing delays may be incurred for real-time flows. In this paper, it is proposed a scheduling algorithm that takes traffic types of flows into consideration when scheduling packets and also it is provided scheduling flexibility by trading off video quality to meet the playback deadline. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Data%20communication" title="Data communication">Data communication</a>, <a href="https://publications.waset.org/search?q=Real-time" title=" Real-time"> Real-time</a>, <a href="https://publications.waset.org/search?q=Scheduling" title=" Scheduling"> Scheduling</a>, <a href="https://publications.waset.org/search?q=Video%0Atransport." title=" Video transport."> Video transport.</a> </p> <a href="https://publications.waset.org/8644/a-new-scheduling-algorithm-based-on-traffic-classification-using-imprecise-computation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/8644/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/8644/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/8644/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/8644/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/8644/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/8644/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/8644/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/8644/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/8644/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/8644/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/8644.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">1474</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">298</span> Comparative Study of Scheduling Algorithms for LTE Networks </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Samia%20Dardouri">Samia Dardouri</a>, <a href="https://publications.waset.org/search?q=Ridha%20Bouallegue"> Ridha Bouallegue</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Scheduling is the process of dynamically allocating physical resources to User Equipment (UE) based on scheduling algorithms implemented at the LTE base station. Various algorithms have been proposed by network researchers as the implementation of scheduling algorithm which represents an open issue in Long Term Evolution (LTE) standard. This paper makes an attempt to study and compare the performance of PF, MLWDF and EXP/PF scheduling algorithms. The evaluation is considered for a single cell with interference scenario for different flows such as Best effort, Video and VoIP in a pedestrian and vehicular environment using the LTE-Sim network simulator. The comparative study is conducted in terms of system throughput, fairness index, delay, packet loss ratio (PLR) and total cell spectral efficiency.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=LTE" title="LTE">LTE</a>, <a href="https://publications.waset.org/search?q=Multimedia%20flows" title=" Multimedia flows"> Multimedia flows</a>, <a href="https://publications.waset.org/search?q=Scheduling%20algorithms." title=" Scheduling algorithms."> Scheduling algorithms.</a> </p> <a href="https://publications.waset.org/9997761/comparative-study-of-scheduling-algorithms-for-lte-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9997761/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9997761/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9997761/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9997761/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9997761/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9997761/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9997761/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9997761/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9997761/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9997761/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9997761.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">4811</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">297</span> The Simulation and Realization of Input-Buffer Scheduling Algorithm in Satellite Switching System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Yi%20Zhang">Yi Zhang</a>, <a href="https://publications.waset.org/search?q=Quan%20Zhou"> Quan Zhou</a>, <a href="https://publications.waset.org/search?q=Jun%20Li"> Jun Li</a>, <a href="https://publications.waset.org/search?q=Yanlang%20Hu"> Yanlang Hu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Scheduling algorithm is a key technology in satellite switching system with input-buffer. In this paper, a new scheduling algorithm and its realization are proposed. Based on Crossbar switching fabric, the algorithm adopts serial scheduling strategy and adjusts the output port arbitrating strategy for the better equity of every port. Consequently, it increases the matching probability. The algorithm can greatly reduce the scheduling delay and cell loss rate. The analysis and simulation results by OPNET show that the proposed algorithm has the better performance than others in average delay and cell loss rate, and has the equivalent complexity. On the basis of these results, the hardware realization and simulation based on FPGA are completed, which validate the feasibility of the new scheduling algorithm.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Scheduling%20algorithm" title="Scheduling algorithm">Scheduling algorithm</a>, <a href="https://publications.waset.org/search?q=input-buffer" title=" input-buffer"> input-buffer</a>, <a href="https://publications.waset.org/search?q=serial%20scheduling" title=" serial scheduling"> serial scheduling</a>, <a href="https://publications.waset.org/search?q=hardware%20design." title=" hardware design."> hardware design.</a> </p> <a href="https://publications.waset.org/16362/the-simulation-and-realization-of-input-buffer-scheduling-algorithm-in-satellite-switching-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/16362/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/16362/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/16362/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/16362/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/16362/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/16362/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/16362/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/16362/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/16362/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/16362/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/16362.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">1475</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">296</span> Achieving Fair Share Objectives via Goal-Oriented Parallel Computer Job Scheduling Policies</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Sangsuree%20Vasupongayya">Sangsuree Vasupongayya</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Fair share is one of the scheduling objectives supported on many production systems. However, fair share has been shown to cause performance problems for some users, especially the users with difficult jobs. This work is focusing on extending goaloriented parallel computer job scheduling policies to cover the fair share objective. Goal-oriented parallel computer job scheduling policies have been shown to achieve good scheduling performances when conflicting objectives are required. Goal-oriented policies achieve such good performance by using anytime combinatorial search techniques to find a good compromised schedule within a time limit. The experimental results show that the proposed goal-oriented parallel computer job scheduling policy (namely Tradeofffs( Tw:avgX)) achieves good scheduling performances and also provides good fair share performance.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=goal-oriented%20parallel%20job%20scheduling%20policies" title="goal-oriented parallel job scheduling policies">goal-oriented parallel job scheduling policies</a>, <a href="https://publications.waset.org/search?q=fairshare." title=" fairshare."> fairshare.</a> </p> <a href="https://publications.waset.org/8454/achieving-fair-share-objectives-via-goal-oriented-parallel-computer-job-scheduling-policies" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/8454/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/8454/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/8454/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/8454/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/8454/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/8454/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/8454/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/8454/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/8454/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/8454/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/8454.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">1191</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">295</span> The Application of Bayesian Heuristic for Scheduling in Real-Time Private Clouds</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Sahar%20Sohrabi">Sahar Sohrabi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The emergence of Cloud data centers has revolutionized the IT industry. Private Clouds in specific provide Cloud services for certain group of customers/businesses. In a real-time private Cloud each task that is given to the system has a deadline that desirably should not be violated. Scheduling tasks in a real-time private CLoud determine the way available resources in the system are shared among incoming tasks. The aim of the scheduling policy is to optimize the system outcome which for a real-time private Cloud can include: energy consumption, deadline violation, execution time and the number of host switches. Different scheduling policies can be used for scheduling. Each lead to a sub-optimal outcome in a certain settings of the system. A Bayesian Scheduling strategy is proposed for scheduling to further improve the system outcome. The Bayesian strategy showed to outperform all selected policies. It also has the flexibility in dealing with complex pattern of incoming task and has the ability to adapt. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Bayesian" title="Bayesian">Bayesian</a>, <a href="https://publications.waset.org/search?q=cloud%20computing" title=" cloud computing"> cloud computing</a>, <a href="https://publications.waset.org/search?q=real-time%20private%20cloud" title=" real-time private cloud"> real-time private cloud</a>, <a href="https://publications.waset.org/search?q=scheduling." title=" scheduling."> scheduling.</a> </p> <a href="https://publications.waset.org/10004070/the-application-of-bayesian-heuristic-for-scheduling-in-real-time-private-clouds" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10004070/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10004070/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10004070/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10004070/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10004070/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10004070/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10004070/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10004070/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10004070/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10004070/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10004070.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">1409</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">294</span> Feedback-Controlled Server for Scheduling Aperiodic Tasks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Shinpei%20Kato">Shinpei Kato</a>, <a href="https://publications.waset.org/search?q=Nobuyuki%20Yamasaki"> Nobuyuki Yamasaki</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper proposes a scheduling scheme using feedback control to reduce the response time of aperiodic tasks with soft real-time constraints. We design an algorithm based on the proposed scheduling scheme and Total Bandwidth Server (TBS) that is a conventional server technique for scheduling aperiodic tasks. We then describe the feedback controller of the algorithm and give the control parameter tuning methods. The simulation study demonstrates that the algorithm can reduce the mean response time up to 26% compared to TBS in exchange for slight deadline misses. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Real-Time%20Systems" title="Real-Time Systems">Real-Time Systems</a>, <a href="https://publications.waset.org/search?q=Aperiodic%20Task%20Scheduling" title=" Aperiodic Task Scheduling"> Aperiodic Task Scheduling</a>, <a href="https://publications.waset.org/search?q=Feedback-Control%20Scheduling" title=" Feedback-Control Scheduling"> Feedback-Control Scheduling</a>, <a href="https://publications.waset.org/search?q=Total%20Bandwidth%20Server." title=" Total Bandwidth Server."> Total Bandwidth Server.</a> </p> <a href="https://publications.waset.org/4197/feedback-controlled-server-for-scheduling-aperiodic-tasks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/4197/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/4197/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/4197/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/4197/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/4197/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/4197/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/4197/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/4197/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/4197/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/4197/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/4197.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">1724</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">293</span> Energy-Aware Scheduling in Real-Time Systems: An Analysis of Fair Share Scheduling and Priority-Driven Preemptive Scheduling</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Su%20Xiaohan">Su Xiaohan</a>, <a href="https://publications.waset.org/search?q=Jin%20Chicheng"> Jin Chicheng</a>, <a href="https://publications.waset.org/search?q=Liu%20Yijing"> Liu Yijing</a>, <a href="https://publications.waset.org/search?q=Burra%20Venkata%20Durga%20Kumar"> Burra Venkata Durga Kumar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Energy-aware scheduling in real-time systems aims to minimize energy consumption, but issues related to resource reservation and timing constraints remain challenges. This study focuses on analyzing two scheduling algorithms, Fair-Share Scheduling (FFS) and Priority-Driven Preemptive Scheduling (PDPS), for solving these issues and energy-aware scheduling in real-time systems. Based on research on both algorithms and the processes of solving two problems, it can be found that FFS ensures fair allocation of resources but needs to improve with an imbalanced system load. And PDPS prioritizes tasks based on criticality to meet timing constraints through preemption but relies heavily on task prioritization and may not be energy efficient. Therefore, improvements to both algorithms with energy-aware features will be proposed. Future work should focus on developing hybrid scheduling techniques that minimize energy consumption through intelligent task prioritization, resource allocation, and meeting time constraints.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Energy-aware%20scheduling" title="Energy-aware scheduling">Energy-aware scheduling</a>, <a href="https://publications.waset.org/search?q=fair-share%20scheduling" title=" fair-share scheduling"> fair-share scheduling</a>, <a href="https://publications.waset.org/search?q=priority-driven%20preemptive%20scheduling" title=" priority-driven preemptive scheduling"> priority-driven preemptive scheduling</a>, <a href="https://publications.waset.org/search?q=real-time%20systems" title=" real-time systems"> real-time systems</a>, <a href="https://publications.waset.org/search?q=optimization" title=" optimization"> optimization</a>, <a href="https://publications.waset.org/search?q=resource%20reservation" title=" resource reservation"> resource reservation</a>, <a href="https://publications.waset.org/search?q=timing%20constraints." title=" timing constraints."> timing constraints.</a> </p> <a href="https://publications.waset.org/10013645/energy-aware-scheduling-in-real-time-systems-an-analysis-of-fair-share-scheduling-and-priority-driven-preemptive-scheduling" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10013645/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10013645/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10013645/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10013645/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10013645/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10013645/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10013645/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10013645/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10013645/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10013645/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10013645.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 publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">292</span> SATA: A Web Based Scheduling Support System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Rajeswari%20Raju">Rajeswari Raju</a>, <a href="https://publications.waset.org/search?q=Saiful%20Nizam%20Warris"> Saiful Nizam Warris</a>, <a href="https://publications.waset.org/search?q=Hazlifah%20Mohd%20Rusli"> Hazlifah Mohd Rusli</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Developing a university course schedule is difficult. This is due to the limitations in the resources available. The process is made even harder with different faculties or departments having different ways of stating their schedule requirements. The person in charge of taking the schedule requirements and turning them into a proper course schedule is not only burden with the task of allocating the appropriate classes and time to lecturers and students, they also need to understand the schedule requirements. Therefore a scheduling support system named SATA is developed to assist ICRESS in the course scheduling process. SATA has been put to use for several semesters and the results have been encouraging. It won a bronze medal in the 2008 Invention, Innovation and Design competition (IID-08) and has been submitted to be patented in October 2008 <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Course%20Scheduling" title="Course Scheduling">Course Scheduling</a>, <a href="https://publications.waset.org/search?q=Scheduling%20Tool%20Aid." title=" Scheduling Tool Aid."> Scheduling Tool Aid.</a> </p> <a href="https://publications.waset.org/1776/sata-a-web-based-scheduling-support-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/1776/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/1776/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/1776/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/1776/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/1776/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/1776/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/1776/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/1776/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/1776/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/1776/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/1776.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">1573</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">291</span> Performance Analysis of List Scheduling in Heterogeneous Computing Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Keqin%20Li">Keqin Li</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Given a parallel program to be executed on a heterogeneous computing system, the overall execution time of the program is determined by a schedule. In this paper, we analyze the worst-case performance of the list scheduling algorithm for scheduling tasks of a parallel program in a mixed-machine heterogeneous computing system such that the total execution time of the program is minimized. We prove tight lower and upper bounds for the worst-case performance ratio of the list scheduling algorithm. We also examine the average-case performance of the list scheduling algorithm. Our experimental data reveal that the average-case performance of the list scheduling algorithm is much better than the worst-case performance and is very close to optimal, except for large systems with large heterogeneity. Thus, the list scheduling algorithm is very useful in real applications. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Average-case%20performance" title="Average-case performance">Average-case performance</a>, <a href="https://publications.waset.org/search?q=list%20scheduling%20algorithm" title=" list scheduling algorithm"> list scheduling algorithm</a>, <a href="https://publications.waset.org/search?q=mixed-machine%20heterogeneous%20computing%20system" title="mixed-machine heterogeneous computing system">mixed-machine heterogeneous computing system</a>, <a href="https://publications.waset.org/search?q=worst-case%20performance." title=" worst-case performance."> worst-case performance.</a> </p> <a href="https://publications.waset.org/11646/performance-analysis-of-list-scheduling-in-heterogeneous-computing-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/11646/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/11646/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/11646/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/11646/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/11646/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/11646/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/11646/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/11646/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/11646/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/11646/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/11646.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">1349</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">290</span> Analysis and Research of Two-Level Scheduling Profile for Open Real-Time System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Yongxian%20Jin">Yongxian Jin</a>, <a href="https://publications.waset.org/search?q=Jingzhou%20Huang"> Jingzhou Huang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>In an open real-time system environment, the coexistence of different kinds of real-time and non real-time applications makes the system scheduling mechanism face new requirements and challenges. One two-level scheduling scheme of the open real-time systems is introduced, and points out that hard and soft real-time applications are scheduled non-distinctively as the same type real-time applications, the Quality of Service (QoS) cannot be guaranteed. It has two flaws: The first, it can not differentiate scheduling priorities of hard and soft real-time applications, that is to say, it neglects characteristic differences between hard real-time applications and soft ones, so it does not suit a more complex real-time environment. The second, the worst case execution time of soft real-time applications cannot be predicted exactly, so it is not worth while to cost much spending in order to assure all soft real-time applications not to miss their deadlines, and doing that may cause resource wasting. In order to solve this problem, a novel two-level real-time scheduling mechanism (including scheduling profile and scheduling algorithm) which adds the process of dealing with soft real-time applications is proposed. Finally, we verify real-time scheduling mechanism from two aspects of theory and experiment. The results indicate that our scheduling mechanism can achieve the following objectives. (1) It can reflect the difference of priority when scheduling hard and soft real-time applications. (2) It can ensure schedulability of hard real-time applications, that is, their rate of missing deadline is 0. (3) The overall rate of missing deadline of soft real-time applications can be less than 1. (4) The deadline of a non-real-time application is not set, whereas the scheduling algorithm that server 0 S uses can avoid the “starvation" of jobs and increase QOS. By doing that, our scheduling mechanism is more compatible with different types of applications and it will be applied more widely.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Hard%20real-time" title="Hard real-time">Hard real-time</a>, <a href="https://publications.waset.org/search?q=two-level%20scheduling%20profile" title=" two-level scheduling profile"> two-level scheduling profile</a>, <a href="https://publications.waset.org/search?q=open%20real-time%20system" title=" open real-time system"> open real-time system</a>, <a href="https://publications.waset.org/search?q=non-distinctive%20schedule" title=" non-distinctive schedule"> non-distinctive schedule</a>, <a href="https://publications.waset.org/search?q=soft%20real-time" title=" soft real-time"> soft real-time</a> </p> <a href="https://publications.waset.org/6115/analysis-and-research-of-two-level-scheduling-profile-for-open-real-time-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/6115/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/6115/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/6115/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/6115/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/6115/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/6115/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/6115/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/6115/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/6115/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/6115/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/6115.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">1568</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">289</span> Design Considerations of Scheduling Systems Suitable for PCB Manufacturing</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Oscar%20Fernandez-Flores">Oscar Fernandez-Flores</a>, <a href="https://publications.waset.org/search?q=Tony%20Speer"> Tony Speer</a>, <a href="https://publications.waset.org/search?q=Rodney%20Day"> Rodney Day</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper identifies five key design characteristics of production scheduling software systems in printed circuit board (PCB) manufacturing. The authors consider that, in addition to an effective scheduling engine, a scheduling system should be able to process a preventative maintenance calendar, to give the user the flexibility to handle data using a variety of electronic sources, to run simulations to support decision-making, and to have simple and customisable graphical user interfaces. These design considerations were the result of a review of academic literature, the evaluation of commercial applications and a compilation of requirements of a PCB manufacturer. It was found that, from those systems that were evaluated, those that effectively addressed all five characteristics outlined in this paper were the most robust of all and could be used in PCB manufacturing. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Decision-making" title="Decision-making">Decision-making</a>, <a href="https://publications.waset.org/search?q=ERP" title=" ERP"> ERP</a>, <a href="https://publications.waset.org/search?q=PCB" title=" PCB"> PCB</a>, <a href="https://publications.waset.org/search?q=scheduling." title=" scheduling."> scheduling.</a> </p> <a href="https://publications.waset.org/2927/design-considerations-of-scheduling-systems-suitable-for-pcb-manufacturing" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/2927/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/2927/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/2927/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/2927/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/2927/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/2927/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/2927/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/2927/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/2927/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/2927/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/2927.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">1804</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">288</span> An MCDM Approach to Selection Scheduling Rule in Robotic Flexibe Assembly Cells</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Khalid%20Abd">Khalid Abd</a>, <a href="https://publications.waset.org/search?q=Kazem%20Abhary"> Kazem Abhary</a>, <a href="https://publications.waset.org/search?q=Romeo%20Marian"> Romeo Marian</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Multiple criteria decision making (MCDM) is an approach to ranking the solutions and finding the best one when two or more solutions are provided. In this study, MCDM approach is proposed to select the most suitable scheduling rule of robotic flexible assembly cells (RFACs). Two MCDM approaches, Analytic Hierarchy Process (AHP) and Technique for Order Preference by Similarity to Ideal Solution (TOPSIS) are proposed for solving the scheduling rule selection problem. The AHP method is employed to determine the weights of the evaluation criteria, while the TOPSIS method is employed to obtain final ranking order of scheduling rules. Four criteria are used to evaluate the scheduling rules. Also, four scheduling policies of RFAC are examined to choose the most appropriate one for this purpose. A numerical example illustrates applications of the suggested methodology. The results show that the methodology is practical and works in RFAC settings.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=AHP" title="AHP">AHP</a>, <a href="https://publications.waset.org/search?q=TOPSIS" title=" TOPSIS"> TOPSIS</a>, <a href="https://publications.waset.org/search?q=Scheduling%20rules%20selection" title=" Scheduling rules selection"> Scheduling rules selection</a> </p> <a href="https://publications.waset.org/13252/an-mcdm-approach-to-selection-scheduling-rule-in-robotic-flexibe-assembly-cells" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/13252/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/13252/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/13252/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/13252/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/13252/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/13252/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/13252/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/13252/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/13252/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/13252/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/13252.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">1812</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">287</span> A Modified Maximum Urgency First Scheduling Algorithm for Real-Time Tasks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Vahid%20Salmani">Vahid Salmani</a>, <a href="https://publications.waset.org/search?q=Saman%20Taghavi%20Zargar"> Saman Taghavi Zargar</a>, <a href="https://publications.waset.org/search?q=Mahmoud%20Naghibzadeh"> Mahmoud Naghibzadeh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents a modified version of the maximum urgency first scheduling algorithm. The maximum urgency algorithm combines the advantages of fixed and dynamic scheduling to provide the dynamically changing systems with flexible scheduling. This algorithm, however, has a major shortcoming due to its scheduling mechanism which may cause a critical task to fail. The modified maximum urgency first scheduling algorithm resolves the mentioned problem. In this paper, we propose two possible implementations for this algorithm by using either earliest deadline first or modified least laxity first algorithms for calculating the dynamic priorities. These two approaches are compared together by simulating the two algorithms. The earliest deadline first algorithm as the preferred implementation is then recommended. Afterwards, we make a comparison between our proposed algorithm and maximum urgency first algorithm using simulation and results are presented. It is shown that modified maximum urgency first is superior to maximum urgency first, since it usually has less task preemption and hence, less related overhead. It also leads to less failed non-critical tasks in overloaded situations. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Modified%20maximum%20urgency%20first" title="Modified maximum urgency first">Modified maximum urgency first</a>, <a href="https://publications.waset.org/search?q=maximum%0Aurgency%20first" title=" maximum urgency first"> maximum urgency first</a>, <a href="https://publications.waset.org/search?q=real-time%20systems" title=" real-time systems"> real-time systems</a>, <a href="https://publications.waset.org/search?q=scheduling." title=" scheduling."> scheduling.</a> </p> <a href="https://publications.waset.org/8174/a-modified-maximum-urgency-first-scheduling-algorithm-for-real-time-tasks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/8174/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/8174/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/8174/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/8174/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/8174/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/8174/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/8174/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/8174/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/8174/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/8174/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/8174.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">2731</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">286</span> Scheduling a Project to Minimize Costs of Material Requirements</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Amir%20Abbas%20Najafi">Amir Abbas Najafi</a>, <a href="https://publications.waset.org/search?q=Nima%20Zoraghi"> Nima Zoraghi</a>, <a href="https://publications.waset.org/search?q=Fatemeh%20Azimi"> Fatemeh Azimi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Traditionally, project scheduling and material planning have been treated independently. In this research, a mixed integer programming model is presented to integrate project scheduling and materials ordering problems. The goal is to minimize the total material holding and ordering costs. In addition, an efficient metaheuristic algorithm is proposed to solve the model. The proposed algorithm is computationally tested, the results are analyzed, and conclusions are given.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Project%20scheduling" title="Project scheduling">Project scheduling</a>, <a href="https://publications.waset.org/search?q=metaheuristic" title=" metaheuristic"> metaheuristic</a>, <a href="https://publications.waset.org/search?q=material%20ordering" title=" material ordering"> material ordering</a>, <a href="https://publications.waset.org/search?q=optimization." title=" optimization."> optimization.</a> </p> <a href="https://publications.waset.org/9664/scheduling-a-project-to-minimize-costs-of-material-requirements" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9664/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9664/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9664/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9664/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9664/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9664/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9664/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9664/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9664/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9664/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9664.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">1703</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">285</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/search?q=Zaki%20Ahmad%20Khan">Zaki Ahmad Khan</a>, <a href="https://publications.waset.org/search?q=Jamshed%20Siddiqui"> Jamshed Siddiqui</a>, <a href="https://publications.waset.org/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 types 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/search?q=Dynamic%20algorithm" title="Dynamic algorithm">Dynamic algorithm</a>, <a href="https://publications.waset.org/search?q=Load%20imbalance" title=" Load imbalance"> Load imbalance</a>, <a href="https://publications.waset.org/search?q=Mapping" title=" Mapping"> Mapping</a>, <a href="https://publications.waset.org/search?q=Task%0D%0Ascheduling." title=" Task scheduling."> Task scheduling.</a> </p> <a href="https://publications.waset.org/10001389/performance-evaluation-of-task-scheduling-algorithm-on-lcq-network" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10001389/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10001389/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10001389/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10001389/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10001389/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10001389/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10001389/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10001389/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10001389/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10001389/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10001389.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">2021</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">284</span> Customization of a Real-Time Operating System Scheduler with Aspect-Oriented Programming</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Kazuki%20Abe">Kazuki Abe</a>, <a href="https://publications.waset.org/search?q=Myungryun%20Yoo"> Myungryun Yoo</a>, <a href="https://publications.waset.org/search?q=Takanori%20Yokoyama"> Takanori Yokoyama</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Tasks of an application program of an embedded system are managed by the scheduler of a real-time operating system (RTOS). Most RTOSs adopt just fixed priority scheduling, which is not optimal in all cases. Some applications require earliest deadline first (EDF) scheduling, which is an optimal scheduling algorithm. In order to develop an efficient real-time embedded system, the scheduling algorithm of the RTOS should be selectable. The paper presents a method to customize the scheduler using aspectoriented programming. We define aspects to replace the fixed priority scheduling mechanism of an OSEK OS with an EDF scheduling mechanism. By using the aspects, we can customize the scheduler without modifying the original source code. We have applied the aspects to an OSEK OS and get a customized operating system with EDF scheduling. The evaluation results show that the overhead of aspect-oriented programming is small enough. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=aspect-oriented%20programming" title="aspect-oriented programming">aspect-oriented programming</a>, <a href="https://publications.waset.org/search?q=embedded%20system" title=" embedded system"> embedded system</a>, <a href="https://publications.waset.org/search?q=operating%20system" title=" operating system"> operating system</a>, <a href="https://publications.waset.org/search?q=real-time%20system" title=" real-time system"> real-time system</a> </p> <a href="https://publications.waset.org/8742/customization-of-a-real-time-operating-system-scheduler-with-aspect-oriented-programming" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/8742/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/8742/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/8742/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/8742/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/8742/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/8742/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/8742/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/8742/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/8742/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/8742/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/8742.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">1833</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">283</span> Efficient Scheduling Algorithm for QoS Support in High Speed Downlink Packet Access Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=MohammadReza%20HeidariNezhad">MohammadReza HeidariNezhad</a>, <a href="https://publications.waset.org/search?q=Zuriati%20Ahmad%20Zukarnain"> Zuriati Ahmad Zukarnain</a>, <a href="https://publications.waset.org/search?q=Nur%20Izura%20Udzir"> Nur Izura Udzir</a>, <a href="https://publications.waset.org/search?q=Mohamed%20Othman"> Mohamed Othman</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we propose APO, a new packet scheduling scheme with Quality of Service (QoS) support for hybrid of real and non-real time services in HSDPA networks. The APO scheduling algorithm is based on the effective channel anticipation model. In contrast to the traditional schemes, the proposed method is implemented based on a cyclic non-work-conserving discipline. Simulation results indicated that proposed scheme has good capability to maximize the channel usage efficiency in compared to another exist scheduling methods. Simulation results demonstrate the effectiveness of the proposed algorithm. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Scheduling%20Algorithm" title="Scheduling Algorithm">Scheduling Algorithm</a>, <a href="https://publications.waset.org/search?q=Quality%20of%20Service" title=" Quality of Service"> Quality of Service</a>, <a href="https://publications.waset.org/search?q=HSDPA." title=" HSDPA."> HSDPA.</a> </p> <a href="https://publications.waset.org/11124/efficient-scheduling-algorithm-for-qos-support-in-high-speed-downlink-packet-access-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/11124/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/11124/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/11124/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/11124/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/11124/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/11124/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/11124/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/11124/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/11124/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/11124/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/11124.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">1590</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">282</span> Bandwidth and Delay Aware Routing Protocol with Scheduling Algorithm for Multi Hop Mobile Ad Hoc Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Y.%20Harold%20Robinson">Y. Harold Robinson</a>, <a href="https://publications.waset.org/search?q=E.%20Golden%20Julie"> E. Golden Julie</a>, <a href="https://publications.waset.org/search?q=S.%20Balaji"> S. Balaji</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The scheduling based routing scheme is presented in this paper to avoid link failure. The main objective of this system is to introduce a cross-layer protocol framework that integrates routing with priority-based traffic management and distributed transmission scheduling. The reservation scheme is based on ID. The presented scheme guarantees that bandwidth reserved time slot is used by another packet in which end-to-end reservation is achieved. The Bandwidth and Delay Aware Routing Protocol with Scheduling Algorithm is presented to allocate channels efficiently. The experimental results show that the presented schemes performed well in various parameters compared to existing methods. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Integrated%20routing" title="Integrated routing">Integrated routing</a>, <a href="https://publications.waset.org/search?q=scheduling" title=" scheduling"> scheduling</a>, <a href="https://publications.waset.org/search?q=MAC%20layer" title=" MAC layer"> MAC layer</a>, <a href="https://publications.waset.org/search?q=IEEE%20802.11." title=" IEEE 802.11. "> IEEE 802.11. </a> </p> <a href="https://publications.waset.org/10006380/bandwidth-and-delay-aware-routing-protocol-with-scheduling-algorithm-for-multi-hop-mobile-ad-hoc-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10006380/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10006380/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10006380/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10006380/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10006380/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10006380/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10006380/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10006380/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10006380/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10006380/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10006380.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">1185</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">281</span> Processor Scheduling on Parallel Computers</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Mohammad%20S.%20Laghari">Mohammad S. Laghari</a>, <a href="https://publications.waset.org/search?q=Gulzar%20A.%20Khuwaja"> Gulzar A. Khuwaja</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Many problems in computer vision and image processing present potential for parallel implementations through one of the three major paradigms of geometric parallelism, algorithmic parallelism and processor farming. Static process scheduling techniques are used successfully to exploit geometric and algorithmic parallelism, while dynamic process scheduling is better suited to dealing with the independent processes inherent in the process farming paradigm. This paper considers the application of parallel or multi-computers to a class of problems exhibiting spatial data characteristic of the geometric paradigm. However, by using processor farming paradigm, a dynamic scheduling technique is developed to suit the MIMD structure of the multi-computers. A hybrid scheme of scheduling is also developed and compared with the other schemes. The specific problem chosen for the investigation is the Hough transform for line detection. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Hough%20transforms" title="Hough transforms">Hough transforms</a>, <a href="https://publications.waset.org/search?q=parallel%20computer" title=" parallel computer"> parallel computer</a>, <a href="https://publications.waset.org/search?q=parallel%0Aparadigms" title=" parallel paradigms"> parallel paradigms</a>, <a href="https://publications.waset.org/search?q=scheduling." title=" scheduling."> scheduling.</a> </p> <a href="https://publications.waset.org/15460/processor-scheduling-on-parallel-computers" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/15460/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/15460/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/15460/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/15460/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/15460/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/15460/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/15460/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/15460/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/15460/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/15460/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/15460.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">1651</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">280</span> Performance Analysis of OQSMS and MDDR Scheduling Algorithms for IQ Switches </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=K.%20Navaz">K. Navaz</a>, <a href="https://publications.waset.org/search?q=Kannan%20Balasubramanian"> Kannan Balasubramanian</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Due to the increasing growth of internet users, the emerging applications of multicast are growing day by day and there is a requisite for the design of high-speed switches/routers. Huge amounts of effort have been done into the research area of multicast switch fabric design and algorithms. Different traffic scenarios are the influencing factor which affect the throughput and delay of the switch. The pointer based multicast scheduling algorithms are not performed well under non-uniform traffic conditions. In this work, performance of the switch has been analyzed by applying the advanced multicast scheduling algorithm OQSMS (Optimal Queue Selection Based Multicast Scheduling Algorithm), MDDR (Multicast Due Date Round-Robin Scheduling Algorithm) and MDRR (Multicast Dual Round-Robin Scheduling Algorithm). The results show that OQSMS achieves better switching performance than other algorithms under the uniform, non-uniform and bursty traffic conditions and it estimates optimal queue in each time slot so that it achieves maximum possible throughput. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Multicast" title="Multicast">Multicast</a>, <a href="https://publications.waset.org/search?q=Switch" title=" Switch"> Switch</a>, <a href="https://publications.waset.org/search?q=Delay" title=" Delay"> Delay</a>, <a href="https://publications.waset.org/search?q=Scheduling." title=" Scheduling."> Scheduling.</a> </p> <a href="https://publications.waset.org/10003967/performance-analysis-of-oqsms-and-mddr-scheduling-algorithms-for-iq-switches" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10003967/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10003967/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10003967/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10003967/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10003967/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10003967/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10003967/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10003967/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10003967/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10003967/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10003967.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">1165</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">279</span> Stochastic Scheduling to Minimize Expected Lateness in Multiple Identical Machines</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Ghulam%20Zakria">Ghulam Zakria</a>, <a href="https://publications.waset.org/search?q=Zailin%20Guan"> Zailin Guan </a>, <a href="https://publications.waset.org/search?q=Yasser%20Riaz%20Awan">Yasser Riaz Awan</a>, <a href="https://publications.waset.org/search?q=Wan%20Lizhi"> Wan Lizhi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> There are many real world problems in which parameters like the arrival time of new jobs, failure of resources, and completion time of jobs change continuously. This paper tackles the problem of scheduling jobs with random due dates on multiple identical machines in a stochastic environment. First to assign jobs to different machine centers LPT scheduling methods have been used, after that the particular sequence of jobs to be processed on the machine have been found using simple stochastic techniques. The performance parameter under consideration has been the maximum lateness concerning the stochastic due dates which are independent and exponentially distributed. At the end a relevant problem has been solved using the techniques in the paper.. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Quantity%20Production%20Flow%20Shop" title="Quantity Production Flow Shop">Quantity Production Flow Shop</a>, <a href="https://publications.waset.org/search?q=LPT%20Scheduling" title=" LPT Scheduling"> LPT Scheduling</a>, <a href="https://publications.waset.org/search?q=Stochastic%20Scheduling" title="Stochastic Scheduling">Stochastic Scheduling</a>, <a href="https://publications.waset.org/search?q=Maximum%20Lateness" title=" Maximum Lateness"> Maximum Lateness</a>, <a href="https://publications.waset.org/search?q=Random%20Due%20Dates" title=" Random Due Dates"> Random Due Dates</a> </p> <a href="https://publications.waset.org/3970/stochastic-scheduling-to-minimize-expected-lateness-in-multiple-identical-machines" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/3970/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/3970/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/3970/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/3970/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/3970/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/3970/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/3970/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/3970/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/3970/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/3970/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/3970.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">1393</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">278</span> A Heuristic Algorithm Approach for Scheduling of Multi-criteria Unrelated Parallel Machines</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Farhad%20Kolahan">Farhad Kolahan</a>, <a href="https://publications.waset.org/search?q=Vahid%20Kayvanfar"> Vahid Kayvanfar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>In this paper we address a multi-objective scheduling problem for unrelated parallel machines. In unrelated parallel systems, the processing cost/time of a given job on different machines may vary. The objective of scheduling is to simultaneously determine the job-machine assignment and job sequencing on each machine. In such a way the total cost of the schedule is minimized. The cost function consists of three components, namely; machining cost, earliness/tardiness penalties and makespan related cost. Such scheduling problem is combinatorial in nature. Therefore, a Simulated Annealing approach is employed to provide good solutions within reasonable computational times. Computational results show that the proposed approach can efficiently solve such complicated problems.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Makespan" title="Makespan">Makespan</a>, <a href="https://publications.waset.org/search?q=Parallel%20machines" title=" Parallel machines"> Parallel machines</a>, <a href="https://publications.waset.org/search?q=Scheduling" title=" Scheduling"> Scheduling</a>, <a href="https://publications.waset.org/search?q=Simulated%20Annealing" title=" Simulated Annealing"> Simulated Annealing</a> </p> <a href="https://publications.waset.org/14166/a-heuristic-algorithm-approach-for-scheduling-of-multi-criteria-unrelated-parallel-machines" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/14166/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/14166/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/14166/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/14166/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/14166/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/14166/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/14166/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/14166/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/14166/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/14166/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/14166.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">1655</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">277</span> An Ant Colony Optimization for Dynamic JobScheduling in Grid Environment</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Siriluck%20Lorpunmanee">Siriluck Lorpunmanee</a>, <a href="https://publications.waset.org/search?q=Mohd%20Noor%20Sap"> Mohd Noor Sap</a>, <a href="https://publications.waset.org/search?q=Abdul%20Hanan%20Abdullah"> Abdul Hanan Abdullah</a>, <a href="https://publications.waset.org/search?q=Chai%20Chompoo-inwai"> Chai Chompoo-inwai</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Grid computing is growing rapidly in the distributed heterogeneous systems for utilizing and sharing large-scale resources to solve complex scientific problems. Scheduling is the most recent topic used to achieve high performance in grid environments. It aims to find a suitable allocation of resources for each job. A typical problem which arises during this task is the decision of scheduling. It is about an effective utilization of processor to minimize tardiness time of a job, when it is being scheduled. This paper, therefore, addresses the problem by developing a general framework of grid scheduling using dynamic information and an ant colony optimization algorithm to improve the decision of scheduling. The performance of various dispatching rules such as First Come First Served (FCFS), Earliest Due Date (EDD), Earliest Release Date (ERD), and an Ant Colony Optimization (ACO) are compared. Moreover, the benefit of using an Ant Colony Optimization for performance improvement of the grid Scheduling is also discussed. It is found that the scheduling system using an Ant Colony Optimization algorithm can efficiently and effectively allocate jobs to proper resources. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Grid%20computing" title="Grid computing">Grid computing</a>, <a href="https://publications.waset.org/search?q=Distributed%20heterogeneous%20system" title=" Distributed heterogeneous system"> Distributed heterogeneous system</a>, <a href="https://publications.waset.org/search?q=Ant%20colony%20optimization%20algorithm" title="Ant colony optimization algorithm">Ant colony optimization algorithm</a>, <a href="https://publications.waset.org/search?q=Grid%20scheduling" title=" Grid scheduling"> Grid scheduling</a>, <a href="https://publications.waset.org/search?q=Dispatchingrules." title=" Dispatchingrules."> Dispatchingrules.</a> </p> <a href="https://publications.waset.org/3389/an-ant-colony-optimization-for-dynamic-jobscheduling-in-grid-environment" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/3389/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/3389/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/3389/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/3389/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/3389/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/3389/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/3389/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/3389/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/3389/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/3389/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/3389.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">2706</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">276</span> Flexible Heuristics for Project Scheduling with Limited Resources</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Milo%C5%A1%20%C5%A0eda">Milo拧艩eda</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Resource-constrained project scheduling is an NPhard optimisation problem. There are many different heuristic strategies how to shift activities in time when resource requirements exceed their available amounts. These strategies are frequently based on priorities of activities. In this paper, we assume that a suitable heuristic has been chosen to decide which activities should be performed immediately and which should be postponed and investigate the resource-constrained project scheduling problem (RCPSP) from the implementation point of view. We propose an efficient routine that, instead of shifting the activities, extends their duration. It makes it possible to break down their duration into active and sleeping subintervals. Then we can apply the classical Critical Path Method that needs only polynomial running time. This algorithm can simply be adapted for multiproject scheduling with limited resources. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Project%20management" title="Project management">Project management</a>, <a href="https://publications.waset.org/search?q=resource-constrained%0Ascheduling" title=" resource-constrained scheduling"> resource-constrained scheduling</a>, <a href="https://publications.waset.org/search?q=NP-hard%20problem" title=" NP-hard problem"> NP-hard problem</a>, <a href="https://publications.waset.org/search?q=CPM" title=" CPM"> CPM</a>, <a href="https://publications.waset.org/search?q=heuristic%20method." title=" heuristic method."> heuristic method.</a> </p> <a href="https://publications.waset.org/7847/flexible-heuristics-for-project-scheduling-with-limited-resources" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/7847/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/7847/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/7847/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/7847/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/7847/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/7847/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/7847/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/7847/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/7847/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/7847/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/7847.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">1411</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">275</span> Time Comparative Simulator for Distributed Process Scheduling Algorithms</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Nazleeni%20Samiha%20Haron">Nazleeni Samiha Haron</a>, <a href="https://publications.waset.org/search?q=Anang%20Hudaya%20Muhamad%20Amin"> Anang Hudaya Muhamad Amin</a>, <a href="https://publications.waset.org/search?q=Mohd%20Hilmi%20Hasan"> Mohd Hilmi Hasan</a>, <a href="https://publications.waset.org/search?q=Izzatdin%20Abdul%20Aziz"> Izzatdin Abdul Aziz</a>, <a href="https://publications.waset.org/search?q=Wirdhayu%20Mohd%20Wahid"> Wirdhayu Mohd Wahid</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In any distributed systems, process scheduling plays a vital role in determining the efficiency of the system. Process scheduling algorithms are used to ensure that the components of the system would be able to maximize its utilization and able to complete all the processes assigned in a specified period of time. This paper focuses on the development of comparative simulator for distributed process scheduling algorithms. The objectives of the works that have been carried out include the development of the comparative simulator, as well as to implement a comparative study between three distributed process scheduling algorithms; senderinitiated, receiver-initiated and hybrid sender-receiver-initiated algorithms. The comparative study was done based on the Average Waiting Time (AWT) and Average Turnaround Time (ATT) of the processes involved. The simulation results show that the performance of the algorithms depends on the number of nodes in the system. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Distributed%20Systems" title="Distributed Systems">Distributed Systems</a>, <a href="https://publications.waset.org/search?q=Load%20Sharing" title=" Load Sharing"> Load Sharing</a>, <a href="https://publications.waset.org/search?q=Process%20Scheduling" title=" Process Scheduling"> Process Scheduling</a>, <a href="https://publications.waset.org/search?q=AWT%20and%20ATT" title=" AWT and ATT"> AWT and ATT</a> </p> <a href="https://publications.waset.org/7174/time-comparative-simulator-for-distributed-process-scheduling-algorithms" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/7174/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/7174/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/7174/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/7174/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/7174/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/7174/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/7174/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/7174/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/7174/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/7174/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/7174.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">1626</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">274</span> Sunflower Irrigation with Two Different Types of Soil Moisture Sensors</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=C.%20D.%20Papanikolaou">C. D. Papanikolaou</a>, <a href="https://publications.waset.org/search?q=V.%20A.%20Giouvanis"> V. A. Giouvanis</a>, <a href="https://publications.waset.org/search?q=E.%20A.%20Karatasiou"> E. A. Karatasiou</a>, <a href="https://publications.waset.org/search?q=D.%20S.%20Dimakas"> D. S. Dimakas</a>, <a href="https://publications.waset.org/search?q=M.%20A.%20Sakellariou-Makrantonaki"> M. A. Sakellariou-Makrantonaki</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Irrigation is one of the most important cultivation practices for each crop, especially in areas where rainfall is enough to cover the crop water needs. In such areas, the farmers must irrigate in order to achieve high economical results. The precise irrigation scheduling contributes to irrigation water saving and thus a valuable natural resource is protected. Under this point of view, in the experimental field of the Laboratory of Agricultural Hydraulics of the University of Thessaly, a research was conducted during the growing season of 2012 in order to evaluate the growth, seed and oil production of sunflower as well as the water saving, by applying different methods of irrigation scheduling. Three treatments in four replications were organized. These were: a) surface drip irrigation where the irrigation scheduling based on the Penman-Monteith (PM) method (control); b) surface drip irrigation where the irrigation scheduling based on a soil moisture sensor (SMS); and c) surface drip irrigation, where the irrigation scheduling based on a soil potential sensor (WM).</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Irrigation%20scheduling" title="Irrigation scheduling">Irrigation scheduling</a>, <a href="https://publications.waset.org/search?q=soil%20moisture%20sensors" title=" soil moisture sensors"> soil moisture sensors</a>, <a href="https://publications.waset.org/search?q=sustainable%20agriculture" title=" sustainable agriculture"> sustainable agriculture</a>, <a href="https://publications.waset.org/search?q=water%20saving." title=" water saving."> water saving.</a> </p> <a href="https://publications.waset.org/10009426/sunflower-irrigation-with-two-different-types-of-soil-moisture-sensors" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10009426/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10009426/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10009426/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10009426/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10009426/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10009426/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10009426/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10009426/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10009426/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10009426/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10009426.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">978</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">273</span> Generation Scheduling Optimization of Multi-Hydroplants: A Case Study</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Shuangquan%20Liu">Shuangquan Liu</a>, <a href="https://publications.waset.org/search?q=Jinwen%20Wang"> Jinwen Wang</a>, <a href="https://publications.waset.org/search?q=Dada%20Wang"> Dada Wang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A case study of the generation scheduling optimization of the multi-hydroplants on the Yuan River Basin in China is reported in this paper. Concerning the uncertainty of the inflows, the long/mid-term generation scheduling (LMTGS) problem is solved by a stochastic model in which the inflows are considered as stochastic variables. For the short-term generation scheduling (STGS) problem, a constraint violation priority is defined in case not all constraints are satisfied. Provided the stage-wise separable condition and low dimensions, the hydroplant-based operational region schedules (HBORS) problem is solved by dynamic programming (DP). The coordination of LMTGS and STGS is presented as well. The feasibility and the effectiveness of the models and solution methods are verified by the numerical results. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=generation%20scheduling" title="generation scheduling">generation scheduling</a>, <a href="https://publications.waset.org/search?q=multi-hydroplants" title=" multi-hydroplants"> multi-hydroplants</a>, <a href="https://publications.waset.org/search?q=optimization." title=" optimization."> optimization.</a> </p> <a href="https://publications.waset.org/15980/generation-scheduling-optimization-of-multi-hydroplants-a-case-study" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/15980/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/15980/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/15980/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/15980/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/15980/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/15980/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/15980/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/15980/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/15980/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/15980/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/15980.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">1551</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/search?q=scheduling&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=scheduling&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=scheduling&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=scheduling&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=scheduling&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=scheduling&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=scheduling&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=scheduling&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=scheduling&page=10">10</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=scheduling&page=11">11</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=scheduling&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>