Sciweavers

Share
PODC
2011
ACM
7 years 6 months ago
Scalability versus semantics of concurrent FIFO queues
Maintaining data structure semantics of concurrent queues such as first-in first-out (FIFO) ordering requires expensive synchronization mechanisms which limit scalability. Howev...
Hannes Payer, Harald Röck, Christoph M. Kirsc...
SODA
2008
ACM
124views Algorithms» more  SODA 2008»
8 years 4 months ago
Competitive queue management for latency sensitive packets
We consider the online problem of non-preemptive queue management. An online sequence of packets arrive, each of which has an associated intrinsic value. Packets can be accepted t...
Amos Fiat, Yishay Mansour, Uri Nadav
ISCC
2003
IEEE
8 years 8 months ago
Controlling Bursts in Best-effort Routers for Flow Isolation
In today’s Internet a user can be adversely affected by other users that overload the router. To address this problem, routers need to provide flow isolation. In this paper, we...
Miguel A. Ruiz-Sánchez, Walid Dabbous
GSEM
2007
Springer
8 years 9 months ago
FIFO Queuing of Constant Length Fully Synchronous Jobs
Abstract. The paper examines the behaviour of a saturated multiprocessor system to which fully synchronous parallel jobs are submitted. In order to simplify the analysis, we assume...
Vandy Berten, Raymond R. Devillers, Guy Louchard
books