Sign inSubmit
Tips: “quotes” for a phrase · author:Lee · a DOI goes straight to its article

40 articles for “Dynamic Scheduling”
Set a search alert
Research ArticleOpen accessIn the abstractA Challenge for Routing Algorithms in Optical Multistage Interconnection NetworksMehrnaz Moudi, Mohamed OthmanProblem statement: A class of dynamic interconnection networks is Multistage Interconnection Networks (MINs) that connects input devices to output devices through a number of switch stages. MINs have assumed importance in recent years; because of their cost-effectiveness. Optical MINs are one type of MINs that have large transmission capacity in the communication networks. There is a major problem in Optical … …Journal of Computer Science, Vol. 7, Issue 11 · 29 Aug 2011 · 7,852 accessesView PDFCite
Research ArticleOpen accessIn the abstractDynamic Allocation of CPUs in Multicore Processor for Performance Improvement in Network Security ApplicationsSudhakar Gummadi, Radhakrishnan ShanmugasundaramProblem statement: Multicore and multithreaded CPUs have become the new approach for increase in the performance of the processor based systems. Numerous applications benefit from use of multiple cores. Increasing performance of the system by increasing the number of CPUs of the multicore processor for a given application warrants detailed experimentation. In this study, the results of the experimentation done … …Journal of Computer Science, Vol. 7, Issue 6 · 14 Jun 2011 · 6,844 accessesView PDFCite
Research ArticleOpen accessIn the abstractA Multi-Agent Architecture for QoS Support in Grid EnvironmentAli Rezaee, Amir M. Rahmani, Saeed Parsa, Sahar AdabiGrid computing is emerged as a new distributed computing technology that implements flexible and coordinated resource sharing among dynamic, heterogeneous, unpredictable and geographically distributed collections of resources owned by different individuals and organizations. Due to heterogeneous and dynamic nature of the grid, resource management and application scheduling is a complex undertaking. This paper proposed a multi-agent architecture that addressed resource … …Journal of Computer Science, Vol. 4, Issue 3 · 31 Mar 2008 · 7,081 accessesView PDFCite
Research ArticleOpen accessIn the abstractResource Leveling Using Petrinet and Memetic ApproachK. Raja, S. KumananThe problem of scheduling activities dynamic for a project, within the available resources and adhering to precedence relationships is NP hard combinatorial. Traditional approaches and their extensions are limited in application for simultaneous scheduling of resources with leveling. Considering the need for improved modeling and scheduling techniques, this paper proposes the use of Petrinet based approach aided by memetic algorithm. … …American Journal of Applied Sciences, Vol. 4, Issue 5 · 31 May 2007 · 7,085 accessesView PDFCite
Research ArticleOpen accessIn the abstractA Scheduling Algorithm Based on Petri Nets and Simulated AnnealingRachida Hadiby Ghoul, Abdelhamid Benjelloul, Sihem Kechida, Hicham TebbikhThis study aims at presenting a hybrid Flexible Manufacturing System "HFMS" short-term scheduling problem. Based on the art state of general scheduling algorithms, we present the meta-heuristic, we have decided to apply for a given example of HFMS. That was the study of Simulated Annealing Algorithm SA. The HFMS model based on hierarchical Petri nets, was used to represent static … …American Journal of Applied Sciences, Vol. 4, Issue 5 · 31 May 2007 · 7,164 accessesView PDFCite
Research ArticleOpen accessIn the abstractA Simulation-Based Comparison of Multimedia Traffic Prioritization Schemes for High-Performance Input-Queued Packet SwitchesSalman A. AlQahtaniThis study investigates the problem of enabling Quality of Service (QoS) of multimedia traffic at the input port of high-performance input-queued packet switches using a simulation-based evaluation. We focus on the possibility of assuring QoS of multimedia traffic in such switches by implementing traffic prioritization at the input port where each input-queue has been modified to provide a separate buffer … …Journal of Computer Science, Vol. 2, Issue 4 · 30 Apr 2006 · 7,074 accessesView PDFCite
Research ArticleOpen accessAll words, across the recordFault Tolerance Grid Scheduling with Checkpoint Based on Ant Colony SystemSaufi Bukhari, Ku Ruhana Ku-Mahamud, Hiroaki MorinoTask resubmission and checkpoint are among several popular techniques used in providing fault tolerance in grid computing. However, due to the lack of side-by-side comparison, it is not certain of the best technique that would not degrade the system performance in addition to providing fault tolerance capability. This study proposed Dynamic ACS-based Fault Tolerance in grid computing using resubmission to … …Journal of Computer Science, Vol. 13, Issue 8 · 1 Sep 2017 · 7,139 accessesView PDFCite
Research ArticleOpen accessAll words, across the recordTakagi-Sugeno Fuzzy Gains Scheduled PI Controller for Enhancement of Power System StabilityLokman H. Hassan, M. Moghavvemi, Haider A.F. MohamedProblem statement: Power system oscillations affect system stability and may lead to failure if not properly controlled. Approach: A Takagi-Sugeno Fuzzy Gains Scheduled Proportional and Integral (FGPI) controller was proposed for a Thyristor Controlled Series Capacitor (TCSC)-based stabilizer to enhance the power system stability. Linguistic rules and fuzzy inference mechanism are utilized to tune the controller parameters on-line in different … …American Journal of Applied Sciences, Vol. 7, Issue 1 · 31 Jan 2010 · 7,541 accessesView PDFCite
Research ArticleOpen accessAll words, across the recordEffective Load Metric and Efficient Initial Job Placement for Dynamic Load Balancing in ClusterP. Sammulal, M. V. Gopalachari, A. V. BabuHigh performance clusters are being configured specially to give data centers that require extreme performance and the processing power they need. When the data is accessed across clusters the data latency time has significant impact on the performance. In the literature it is given that memory and I/O have become the new bottleneck, instead of processing power in achieving efficient … …Journal of Computer Science, Vol. 4, Issue 1 · 31 Jan 2008 · 6,904 accessesView PDFCite
Research ArticleOpen accessAll words, across the recordReal-time Optimistic Concurrency Control based on Transaction Finish DegreeHan Qilong, Hao ZhongxiaoConcurrency control is one of the main issues in the studies of real-time database systems. Optimistic concurrency control algorithms have the attractive properties of being non-blocking and deadlock-free. However, they have the problems of late conflict detection and transaction restarts. Although the number of transaction restarts is reduced by dynamic adjustment of serialization order in real-time database systems, they are … …Journal of Computer Science, Vol. 1, Issue 4 · 31 Dec 2005 · 6,688 accessesView PDFCite