Rehana Begam

  • Citations Per Year
Learn More
Most real-time scheduling algorithms prioritize tasks solely based on their timing parameters and cannot effectively handle them when they have different execution preferences. In this paper, for a set of periodic tasks, where some tasks are preferably executed as soon as possible (ASAP) and others as late as possible (ALAP), we investigate(More)
To efficiently utilize the resources in cloud computing systems, many allocation algorithms have been studied. In this work, for user requests that have timing constraints (i.e., deadlines), we study time-sensitive resource allocation and virtual machine provisioning schemes in cloud systems. Specifically, considering a cloud system with multiple pools of(More)
As parallel architectures become mainstream, the issue of writing and debugging parallel programs becomes a major concern for today’s computing world. Researchers have shown that different types of concurrency bugs can be effectively detected by checking the validity of various invariants (e.g. inter-thread communication invariants). Existing invariant(More)
Traditionally, real-time scheduling algorithms prioritize tasks solely based on their timing parameters and cannot effectively handle tasks that have different execution preferences . In this paper, for a set of periodic real-time tasks running on a single processor, where some tasks are preferably executed as soon as possible (ASAP) and others as late as(More)
Recently, several studies have considered applications with a single time constraint (i.e., deadline) running on cloud systems. In this work, to effectively support user requests with flexible timing constraints (e.g., users may prefer expedited services and are willing to pay extra for getting their job processed at earlier times), we consider applications(More)
  • 1