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...

We consider priority fluid queueing systems where high priority class has strict priority access to service. Sample path analysis tools, such as Poisson Counter Driven Stochastic Differential Equation, are employed to study system queueing behavior in steady state. We are able to obtain various analytical results for different fluid traffic models and system configurations. Those results can be...

In this paper, we consider a multicore real-time scheduling algorithm incorporating benefits of both fixed-priority and dynamic-priority disciplines. Specifically, the algorithm first assigns globally-effective priorities to real-time tasks statically, based on the well-known Rate-Monotonic scheduling policy. It may however change the task priorities at runtime, only when the tasks reach the ze...