Real time systems that are logically programmed for scientific applications involve frequent job arrivals, thus requires a parallel architecture, so that maximum applications can be executed simultaneously resulting in less waiting time and maximum resource utilization. This must be achieved by workload partitioning & characterization, directs towards the development of Multiprocessor machines,...

With the improvements in wide-area network performance and powerful computers, it is possible to integrate a large number of distributed machines belonging to different organizations as a single system, for example, a grid computing environment. A grid computing environment involves cooperation and sharing resources among distributed machines. Users may dispatch their tasks to remote computing ...

We provide several non-approximability results for deterministic scheduling problems whose objective is to minimize the total job completion time. Unless P = NP, none of the problems under consideration can be approximated in polynomial time within arbitrarily good precision. Most of our results are derived by Max SNP hardness proofs. Among the investigated problems are: scheduling unrelated ma...