We present a new non-blocking implementation of concurrent linked-lists supporting linearizable insertion and deletion operations. The new algorithm provides substantial bene ts over previous schemes: it is conceptually simpler and our prototype operates substantially faster.

Status of this Memo This memo provides information for the Internet community. It does not specify an Internet standard of any kind. Distribution of this memo is unlimited. Abstract This memo documents tracing and non-blocking (bypass) requirements for Open Pluggable Edge Services (OPES).

to compare intubating conditions and hemodynamic changes between bonfils intubation fiberscope and macintosh laryngoscopy without administering neuromuscular blocking drugs (nmbds). methods: in this randomized controlled trial,80 male and female patients, scheduled for elective surgery, aged 15 to 60 years, asa class ii or i, non-obese, non smokers, without anticipated difficult intubation; wer...

This paper generalizes known results for nonblocking distribution networks also known as generalized connection networks to the mul tirate environment where di erent user connec tions share a switch s internal data paths in arbi trary fractions of the total capacity In particular we derive conditions under which networks due to Ofman and Thompson Pippenger and Turner lead to multirate distribut...

We consider the problem of implementing a wait-free regular register from storage components prone to Byzantine faults. We present a simple, efficient, and self-contained construction of such a register. Our construction utilizes a novel building block, called a 1-regular register, which can be efficiently implemented from Byzantine fault-prone components.

Article history: Received 19 December 2013 Received in revised form 8 August 2014 Accepted 21 August 2014 Available online 10 September 2014