While it is widely believed that preemptability is a necessary requirement for developing real-time software, there are additional costs involved with preemptive scheduling, as compared to non-preemptive scheduling. Furthermore, in the context of fixed-priority scheduling, feasibility of a task set with nonpreemptive scheduling does not imply feasibility with preemptive scheduling (and vice-ver...

The author previously [16,15] defined CSP-like operational semantics whose main restrictions were the automatic promotion of most τ actions, no cloning of running processes, and no negative premises in operational semantic rules. He showed that every operator with such an operational semantics can be translated into CSP and therefore has a semantics in every model of CSP. In this paper we demon...

Current congestion control approaches that attempt to provide fair bandwidth allocation among competing flows primarily consider only data rate when making decisions on which packets to drop. However, responsive flows with high round trip times (RTTs) can still receive significantly less bandwidth than responsive flows with low round trip times. This paper proposes a congestion control scheme c...

We distinguish between two ways of thinking about defaults. The rst way, in which defaults augment known premises by`strengthening' the underlying logic, is the traditional approach taken by most existing formalisms. In the second way, defaults are represented in the set of premises, but obtain their default status by having a reduced priority relative to the known premises. In this paper we: 1...

The Address Recalculation Pipeline is a hardware architecture designed to reduce the end-to-end latency suffered by immersive Head Mounted Display virtual reality systems. A demand driven rendering technique known as priority rendering was devised for use in conjunction with the address recalculation pipeline. Using this technique, different sections of a scene can be updated at different rates...

This paper shows how to express circumscription in terms of priority logic, where a theory consists of a set of logic programming like (monotonic) inference rules and a priority relation among them. Priorities determine when such an inference rule can or cannot be applied. Specifically, we show that circumscribing any existential quantifier free theory can be described precisely by a process of...

Equipped with powerful machines and complex softwares, web servers providing services are widely used all over the Internet. But, how to specify their behaviors are interesting and meaningful. However, process algebras nowadays cannot specify the behaviors of web servers with time limitations and different groups of clients who are belong to different groups/priorities. The behaviors of web ser...

In this brief, we introduce a priority encoder that uses a novel priority lookahead (PL) scheme to reduce delays associated with priority propagation. Two priority encoder approaches are presented, one without and the other with a PL scheme. For an -bit encoder, the circuit with the PL scheme requires about 0.1 more transistors than the circuit without the scheme. However, a 32-bit very large s...

0360-8352/$ see front matter 2011 Elsevier Ltd. A doi:10.1016/j.cie.2011.03.003 q This manuscript was handled by area editor Jame ⇑ Corresponding author. E-mail addresses: [email protected] (C. Kim), du A two-stage multi-server tandem queue with two types of processed customers is analyzed. The input is described by the Marked Markovian Arrival Process (MMAP). The first stage has an infinite n...

We present a parallel priority data structure that im proves the running time of certain algorithms for prob lems that lack a fast and work e cient parallel solu tion As a main application we give a parallel imple mentation of Dijkstra s algorithm which runs in O n time while performing O m log n work on a CREW PRAM This is a logarithmic factor improvement for the running time compared with pre...