One of the most important goals in time-constrained workkows is to maximize the number of workkow instances satisfying their deadlines, which requires to manage activity deadlines eeectively. In this paper we propose a new static deadline assignment method called PST that is based on the sojourn time of each activity and the characteristics of workkow control structures. The proposed method gua...

This paper shows how iterative hardware/software partitioning in heterogeneous DSP/FPGA based embedded systems can be utilized to achieve real-time deadlines of modern 3GPP wireless equalization workloads. By utilizing a well defined set of application partitioning criteria in tandem with SOC simulation tools, we are able to show a greater than six fold improvement in application performance an...

The reliable multicast protocol guarantees that all receivers place the source messages in the same order. We hav e changed this protocol from an event driven protocol to a timed protocol in order to also guarantee that all of the receivers have the message by a dead line. In this work we present two modifications to the timed protocol that provide shorter deadlines. In the examples that we con...

We examine the problem of optimizing the reallocation and execution of divisible load originating in merent amounts at the sites of an interconnected set of heterogeneous processors characterized by their load computing speeds and II0 speeds. Each processor imposes, a priori, a hard deadline on its allocated task completion. The objective of load retasking and redistribution, which is implement...

This paper describes COTAMA (COntextual TAsk Management Architecture), a control software architecture layered into tow levels: Decisional level and executive level. The decisional level is in charge of mission monitoring and decision making according to robot context. The executive level applies these decisions while managing all real time aspects such instrumentation conflicts or tasks deadli...

Public agencies have discretion on the time domain, and politicians deploy numerous policy instruments to constrain it. Yet little is known about how administrative procedures that affect timing also affect the quality of agency decisions. We examine whether administrative deadlines shape decision timing and the observed quality of decisions. Using a unique and rich dataset of FDA drug approval...

Three hypotheses--the bound-change hypothesis, drift-rate-change hypothesis, and two-stage-processing hypothesis--are proposed to account for data from a perceptual discrimination task in which three different response deadlines were involved and three different payoffs were presented prior to each individual trial. The aim of the present research was to show (1) how the three different hypothe...

We consider the partitioned scheduling of sporadic, hard-realtime tasks on a multiprocessor platform with static-priority scheduling policies. Most previous work on the static-priority scheduling of sporadic tasks upon multiprocessors has assumed implicit deadlines (i.e. a task’s relative deadline is equal to its period). We relax the equality constraint on a task’s deadline and consider task s...

Request Processing Systems should exhibit predictable behavior by guaranteeing Quality-of-Service parameters. One of the important requirements of predictability is that requests should have maximum acceptable response time thresholds, denoted as deadlines in this paper. In order to provide QoS, the system should try to guarantee these deadlines. This way, it is desirable to use a load-balancin...

In an EV charging facility, with multiple vehicles requesting charge simultaneously, scheduling becomes crucial to provide adequate service under vehicle sojourn time constraints. However, these departure times may not be known accurately, and typical policies such as Earliest-Deadline- First or Least-Laxity-First are affected by this uncertainty in information. paper, we analyze the performanc...