Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 6 of 6 for “"Shared queues"”.

  1. Overloading a Jackson network of shared queues.

    … occur with very low probability. Still, queues can be filled beyond capacity so it is of interest to study the distribution of such occurrences and, as a measure of the reliability of the system, the mean time until an overload. The approach we propose is based on a change of measure …

    ottawa-retro Repository record for Overloading a Jackson network of shared queues. (opens in a new tab)

  2. Sharing memory in distributed systems

    … it possible to translate algorithms for the shared memory model to that for the message passing model. With some minor modifications the algorithm can be used to robustly simulate shared queues, shared stacks, etc. (Abstract shortened with permission of author.).

    unlv Repository record for Sharing memory in distributed systems (opens in a new tab) Download PDF for Sharing memory in distributed systems (opens in a new tab)

  3. New techniques to lower the tail latency in stream processing systems

    … selective replay to catch straggler tuples; (2) shared queues among different tasks of the same operator to reduce overall queueing delay; (3) latency feedback-based load balancing, intended to mitigate heterogenous scenarios. We have implemented these techniques in Apache Storm, and present …

    uiuc Repository record for New techniques to lower the tail latency in stream processing systems (opens in a new tab)

  4. Multiprocessor-safe Wait-free Queue in RTSJ

    … parallelism within computer applications. Shared data structures are in the core of multi-threaded applications; these data structures facilitate the communication between the different threads to help in completing the designed tasks within the application. A control mechanism should be …

    whiterose Download PDF for Multiprocessor-safe Wait-free Queue in RTSJ (opens in a new tab)

  5. A study of covert queueing channels in shared schedulers

    … covert timing channel that may be exploited in shared queues across supposedly isolated users. In our system model, a user modulates messages to another user via his pattern of access to the shared resource. One example of such a channel is the cross-virtual network covert channel in data center …

    uiuc Repository record for A study of covert queueing channels in shared schedulers (opens in a new tab)

  6. Efficient synchronization techniques for shared memory systems

    … structures; common structures, like stacks and queues, are the most widely used inter-thread communication mechanisms. Additionally, synchronization techniques are required to efficiently execute, in a concurrent environment, those parts of modern applications that require significant …

    greece Repository record for Efficient synchronization techniques for shared memory systems (opens in a new tab)