Sarah Tasneem

Learn More
Highly varying job demands generally consist of many short jobs mixed with several long jobs. In principle, without foreknowledge of exact service times of individual jobs, processor sharing is an effective theoretical strategy for handling such demands. In practice, however, processor sharing must be implemented by time-slicing, which incurs non-negligible(More)
In systems where customer service demands are only known probabilistically, there is very little to distinguish between jobs. Therefore, no universal optimum scheduling strategy or algorithm exists. If the distribution of job times is known, then the residual time (expected time remaining for a job), based on the service it has already received, can be(More)
Real-time multi-process scheduling is commonly used in many control situations, where it is important to achieve job completions within specific time intervals. This paper investigates the potential improvement that might be achieved when additional information (notably the residual computing time of each process) is used in the scheduling process. First, a(More)
It is well known, in queueing theory, that the system performance is greatly influenced by scheduling policy. No universal optimum scheduling strategy exists in systems where individual customer service demands are not known a priori. However, if the distribution of job times is known, then the residual time (expected time remaining for a job), based on the(More)
Highly varying job demands generally consist of many short jobs mixed with several long jobs. In this paper, we consider a simple scenario where two job streams with different level of demands must be processed by the same server. We study the performance of several round-robin variants and F CF SP in such a scenario. The simulation results show that on the(More)
The invention of the Internet has ushered in advances in information era which has revolutionized the way we conduct business, advances our knowledge and promote life long learning. Each second a web server computer is bombarded with queries from numerous clients. It is then the web server system that responds to the queries by serving pages to the clients.(More)
—It has been observed in recent years that in many applications service time demands are highly variable. Without foreknowledge of exact service times of individual jobs, processor sharing is an effective theoretical strategy for handling such demands. In practice, however, processor sharing must be implemented by time-slicing with a round-robin discipline.(More)