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

94 results for “scheduling problem”
Set a search alert
Research ArticleOpen accessIn the abstractAn Efficient Fault Tolerant Scheduling Approach for Computational GridP. Keerthika, N. KasthuriGrid computing serves as an important technology to facilitate distributed computation computational grids solve large scale scientific problems using heterogeneous geographically distributed resources. Problems like dispatching and scheduling of tasks are considered as major issues in computational grid environment. The Grid Scheduler must select proper resources for executing the tasks with less response time. There are various reasons such as … …American Journal of Applied Sciences, Vol. 9, Issue 12 · 5 Jan 2013 · 6,995 accessesView PDFCite
Research ArticleOpen accessIn the abstractHybridization of Genetic Algorithm with Parallel Implementation of Simulated Annealing for Job Shop SchedulingThamilselvan Rakkiannan, Balasubramanie PalanisamyProblem statement: The Job Shop Scheduling Problem (JSSP) is observed as one of the most difficult NP-hard, combinatorial problem. The problem consists of determining the most efficient schedule for jobs that are processed on several machines. Approach: In this study Genetic Algorithm (GA) is integrated with the parallel version of Simulated Annealing Algorithm (SA) is applied to the job shop … …American Journal of Applied Sciences, Vol. 9, Issue 10 · 25 Aug 2012 · 7,056 accessesView PDFCite
Research ArticleOpen accessIn the abstractTasks Scheduling using Ant Colony OptimizationA. P. Shanthi, G. Umarani Srikanth, V. Uma Maheswari, Arul SiromoneyProblem statement: Efficient scheduling of the tasks to heterogeneous processors for any application is critical in order to achieve high performance. Finding a feasible schedule for a given task set to a set of heterogeneous processors without exceeding the capacity of the processors, in general, is NP-Hard. Even if there are many conventional approaches available, people have been looking at … …Journal of Computer Science, Vol. 8, Issue 8 · 25 Jul 2012 · 7,668 accessesView PDFCite
Research ArticleOpen accessIn the abstractPerformances of Partition Utility Accrual Real Time Scheduling AlgorithmIdawaty Ahmad, Shamala Subramaniam, Mohamed Othman, Zuriati ZulkarnainProblem statement: This study proposed a TUF/UA real time scheduling algorithm known as Partition Preemptive Utility Accrual Scheduling (PUAS) also known as PPUAS algorithm. This algorithm addressed the overloaded problem that was identified in a uniprocessor scheduling environment and the necessity to design the scheduling algorithm in a multiprocessor environment. Approach: The PUAS algorithm was enhanced into the partitioned multiprocessor … …Journal of Computer Science, Vol. 8, Issue 8 · 12 Jul 2012 · 7,009 accessesView PDFCite
Research ArticleOpen accessIn the abstractNovel Adaptive Job Scheduling Algorithm on Heterogeneous Grid ResourcesG. K. Kamalam, V. Murali BhaskaranGrid provides an infrastructure for sharing geographically distributed heterogeneous resources to process many applications and mainly used for solving scientific problems that requires more computation time. Problem statement: Grid is a dynamic environment, where the resources may join or leave the environment at any time and the jobs also arrives at different intervals of time. To meet the demands and … …American Journal of Applied Sciences, Vol. 9, Issue 8 · 6 Jul 2012 · 6,851 accessesView PDFCite
Research ArticleOpen accessIn the abstractMulti-Threshold based Scheduling for Multi-User Multiple-Input Multiple-Output SystemsK. Chanthirasekaran, M. A. BhagyaveniProblem statement: Multi-User Multi-Input Multi-Output (MU-MIMO) system had eventually used in 4th generation wireless networks either to achieved diversity gain or multiplexing gain. Many recent scheduling addresses the threshold based resource allocation where in resource were not utilized properly. Approach: In this study a new Multi Threshold Based Channel Aware Scheduling (MTCAS) was proposed for performance improvement and proper resource … …Journal of Computer Science, Vol. 8, Issue 7 · 21 Jun 2012 · 6,938 accessesView PDFCite
Research ArticleOpen accessIn the abstractExplicit Allocation Strategy with Deadline and Budget Constraint Algorithm in Bag of Tasks GridM. Suresh Kumar, T. PurusothamanProblem statement: This study is for effective scheduling of grid jobs based on economy for space shared resources in Bag of tasks grid. Grid Computing aims in combining the power of heterogeneous, geographically distributed, multi-domain computational resources to provide high performance or high throughput. Approach: Space shared resources are parallel supercomputers and clusters of workstations that provides a great amount … …Journal of Computer Science, Vol. 8, Issue 7 · 7 Jun 2012 · 6,229 accessesView PDFCite
Research ArticleOpen accessIn the abstractA Dynamic Resource Allocation Method for Parallel DataProcessing in Cloud ComputingV. Venkatesa Kumar, S. PalaniswamiProblem statement: One of the Cloud Services, Infrastructure as a Service (IaaS) provides a Compute resourses for demand in various applications like Parallel Data processing. The computer resources offered in the cloud are extremely dynamic and probably heterogeneous. Nephele is the first data processing framework to explicitly exploit the dynamic resource allocation offered by today’s IaaS clouds for both, task … …Journal of Computer Science, Vol. 8, Issue 5 · 1 Mar 2012 · 7,422 accessesView PDFCite
Research ArticleOpen accessIn the abstractIntegration of Genetic Algorithm with Tabu Search for Job Shop Scheduling with Unordered Subsequence Exchange CrossoverR. Thamilselvan, P. BalasubramanieProblem statement: The problem of scheduling n jobs on m machines with each job having specific machine route has been researched over the decade. The Job Shop Scheduling (JSS) is one of the hardest combinatorial optimization problems. Each resource can process at most one job at a time. Approach: This study proposes a new approach to solve a Job Shop … …Journal of Computer Science, Vol. 8, Issue 5 · 24 Feb 2012 · 6,650 accessesView PDFCite
Research ArticleOpen accessIn the abstractA Forager Bee's Intelligence Inspired Dynamic Queue Scheduling for the Internet TrafficY. Suresh, S. Arumugam, M. A. BhagyaveniProblem statement: In the present evolution of large scale internet communication, per flow control scheme faces scalability issue due to tremendous number of flows. The aggregation based approaches such as differentiated architecture relieve the storage of state of flows in core router. TCP is the dominating protocol that carries majority of the total internet traffic. Recent internet traffic measurement shows … …Journal of Computer Science, Vol. 8, Issue 5 · 22 Feb 2012 · 7,011 accessesView PDFCite