1 - 7
results out of
, Centurion university, On June 23, 2012
In multiprogramming systems, when there is more
than one runable process (i.e., ready), the operating
system must decide which one to activate. The
decision is made by the part of the operating system
called the scheduler , using a scheduling algorithm
, Universidad Veracruzana, Mexico, On July 20, 2010
This paper shows the importance of fair scheduling in grid environment such that all the tasks get equal amount of time for their execution such that it will not lead to starvation. The load balancing of the available resources in the computational grid is another important factor. This paper considers uniform load to be given to the resources. In order to achieve this, load balancing is applied after scheduling the jobs. It also considers the Execution Cost and Bandwidth Cost for the algorithms used here because in a grid environment, the resources are geographically distributed. The implementation of this approach the proposed algorithm reaches optimal solution and minimizes the make span as well as the execution cost and bandwidth cost.
, Harvard University, Massachusetts, On August 12, 2012
Whiteboard used in school settings can also be for displaying activities and projects completed by students. A magnetic whiteboard does not produce dust and a dry erase board can be easily installed in hallways to be used as bulletin boards for announcements and other important school events. Magnetic boards are definitely better and easier to maintain than an ordinary chalkboard.
A Simplistic Study of Scheduler for Real-Time and Embedded System Domain. panduranga rao mv kc shet International Journal International Journal Of Computer Science And Applications Vol. 2, No. 2, November / December 2009 ISSN: 0974-1003
Grid computing is a new paradigm for next generation computing, it enables the sharing and selection of geographically distributed heterogeneous resources for solving large scale problems in science and engineering. Grid computing does require special software that is unique to the computing project for which the grid is being used. In this paper the proposed algorithm namely dynamic load balancing algorithm is created for job scheduling in Grid computing. Particle Swarm Intelligence (PSO) is the latest evolutionary optimization techniques in Swarm Intelligence. It has the better performance of global searching and has been successfully applied to many areas. The performance measure used for scheduling is done by Quality of service (QoS) such as makespan, cost and deadline. Max PSO and Min PSO algorithm has been partially integrated with PSO and finally load on the resources has been balanced.
, Massachusetts Institute of Technology, Massachusetts, On September 15, 2008