Sciweavers

506 search results - page 4 / 102
» Distributing synchronous programs using bounded queues
Sort
View
PPOPP
1997
ACM
13 years 10 months ago
Effective Fine-Grain Synchronization for Automatically Parallelized Programs Using Optimistic Synchronization Primitives
As shared-memory multiprocessors become the dominant commodity source of computation, parallelizing compilers must support mainstream computations that manipulate irregular, point...
Martin C. Rinard
SIGCSE
2000
ACM
193views Education» more  SIGCSE 2000»
13 years 10 months ago
Experimentation with bounded buffer synchronization
Undergraduates are usually introduced to synchronization in operating systems through a discussion of classical problems such as reader-writer or producers-consumers. The traditio...
Steven Robbins
PE
2007
Springer
112views Optimization» more  PE 2007»
13 years 5 months ago
Performance bounds for feedforward queueing networks with upper-constrained inputs
We propose a simple framework for analyzing feedforward queueing networks that have the following features: each customer belongs to a (customer) flow and the route that a custom...
S. Shioda
CONCUR
2011
Springer
12 years 5 months ago
Reasoning about Threads with Bounded Lock Chains
The problem of model checking threads interacting purely via the standard synchronization primitives is key for many concurrent program analyses, particularly dataflow analysis. U...
Vineet Kahlon
SIGADA
1999
Springer
13 years 10 months ago
Redistribution in distributed Ada
In this paper we will demonstrate how Ada and its Distributed Annex may be used to relocate concurrent objects in a distributed data ow application. This relocation mechanism will...
Scott James