We examine a timing game with complete information and observable actions when there is second-mover advantage. Allowing for heterogenous payoffs between players both leader follower payoff functions to be multi-peaked non-monotonic, we develop new solution method characterize the pure-strategy equilibria. Sometimes these resemble familiar advantage equilibria from literature. However, show, de...

This document specifies Multiprotocol Label Switching (MPLS) Traffic Engineering Soft Preemption, a suite of protocol modifications extending the concept of preemption with the goal of reducing or eliminating traffic disruption of preempted Traffic Engineering Label Switched Paths (TE LSPs). Initially, MPLS RSVP-TE was defined with support for only immediate TE LSP displacement upon preemption....

Current schedulability analyses for preemptive systems consider cache behaviour by adding preemption caused cache reload costs. Thereby, they ignore the fact that delays due to cache misses often have a reduced impact because of pipeline effects. In this paper, these methods are called isolated. Pipeline-related preemption costs are not considered at all in current schedulability analyses. This...

Scheduling design of control tasks with fuzzy deadline is considered. By introducing the dedication concept to describe the scheduling criticality of a control task, the largest dedication first with preemption threshold is presented and the preemption threshold is used to control the context switching among control tasks. Every control task is dynamically assigned its priority and feasible pre...

We consider a synchronized bufferless Clos ATM switch with input cell processor queues. The arrival process to each input port of the switch is assumed to be bursty and it is modeled by an Interrupted Bernoulli Process. Two classes of cells are considered. Service in an input cell processor queue is head-of-the-line without preemption. In addition, space preemption is used. That is, a high prio...

Preemption threshold scheduling (PTS) enhances real-time schedulability by controlling preemptiveness of tasks. This benefit of PTS highly depends on a proper algorithm that assigns each task feasible scheduling attributes, which are priority and preemption threshold. Due to the existence of an efficient optimal preemption threshold assignment algorithm that works with fully assigned priority o...

Extensive research has been devoted to preemptive scheduling. However, little attention has been paid to problems where a certain time penalty must be incurred if preemption is allowed. In this paper, we consider the single-machine scheduling problem of minimizing the total completion time subject to job release dates and preemption penalties, where each time a job is started, whether initially...

This paper examines the irreversible adoption of a technology whose returns are uncertain, when there is an advantage to being the first adopter, but a network advantage to adopting when others also do so. Two patterns of adoption emerge: sequential, in which the leader aggressively preempts its rival; and a more accommodating outcome in which the firms adopt simultaneously. There are two main ...