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 job 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)
Often a software program's execution time is characterized by a single value (either mean or worst-case). When multiple tasks are concurrently scheduled with time quanta such that scheduling is based on partial execution (a common scenario in multimedia systems) a more accurate estimation of residual time, R(t), is desired than can be obtained from just the(More)
Small Ubiquitin-like Modifier (SUMO) is a ∼10 kDa peptide that can be post-translationally added to a lysine (K) on a target protein to facilitate protein-protein interactions. Recent studies have found that SUMOylation can be regulated in an activity-dependent manner and that ion channel SUMOylation can alter the biophysical properties and surface(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)