The problem of scheduling multiple streams of realtime customers. is addressed in this paper. The paper first introduces the notion of (m, k)-firm deadlines to better characterize the timing constraints of real-time streams. More specifically, a stream is said to have (m, k)-firm deadlines if at least m out of any k consecutive customers must meet their deadlines. A stream with (m, k)-firm dead...

Scheduling theories for fixed priority scheduling are now sufficiently mature that a genuine engineering approach to the construction of hard real-time systems is possible. In this paper we review recent advances. A flexible computational model is adopted that can accommodate periodic and sporadic activities, different levels of criticality, process interaction and blocking, cooperative schedul...

Soft real-time processing is real-time processing in which some or all applications are allowed to miss deadlines, particularly in situations of system overload. Resource allocation decisions in such systems are often based in part on specifications of application utility or benefit and directly affect which applications will miss deadlines and by how much. A feedback mechanism is often provide...

Datacenters have become increasingly important to host a diverse range of cloud applications with mixed workloads. Traditional applications hosted by datacenters are throughput-oriented without delay requirements, but newer generations of cloud applications, such as web search, recommendations, and social networking, typically employ a tree-based Partition-Aggregate structure, which may incur b...

| In a deadline-ordered service discipline, packets are assigned transmission deadlines and are transmitted in increasing order of deadlines. Diierent deadline-ordered service disciplines are distinguished by how they deene deadlines. One of the more diicult analytical problems one faces when designing a new deadline-ordered service discipline is to prove that one can bound the end of transmiss...

Norms have been proposed as a way to regulate multi-agent systems. In order to operationalize norms, several computational frameworks have been proposed for programming norm-governed agent organizations. It has been argued that in such systems it is essential that norms, in particular those giving rise to achievement obligations, have deadlines. In this paper we propose a novel semantic framewo...