K. V. Deeba

  • Citations Per Year
Learn More
Efficient multiprocessor scheduling is essentially the problem of allocating a set of computational jobs to a set of processors to minimize the overall execution time. The main issue is how jobs are partitioned in which total finishing time and waiting time is minimized. Minimization of these two criteria simultaneously, is a multi objective optimization(More)
Job Scheduling in a Multiprocessor architecture is an extremely difficult NP hard problem, because it requires a large combinatorial search space and also precedence constraints between the processes. For the effective utilization of multiprocessor system, efficient assignment and scheduling of jobs is more important. This paper proposes a new improved(More)
Vast amounts of life sciences data are scattered around the world in the form of a variety of heterogeneous data sources. The need to be able to co-relate relevant information is fundamental to increase the overall knowledge and understanding of a specific subject. Bioinformaticians aspire to find ways to integrate biological data sources for this purpose(More)
  • 1