Sciweavers

6540 search results - page 1169 / 1308
» Data Stream Sharing
Sort
View
IPPS
1998
IEEE
15 years 8 months ago
An Efficient Counting Network
Counting networks were introduced as a new class of concurrent, distributed, low contention data structures suitable for implementing shared counters. Their structure is similar t...
Costas Busch, Marios Mavronicolas
ISCA
1998
IEEE
123views Hardware» more  ISCA 1998»
15 years 8 months ago
Weak Ordering - A New Definition
A memory model for a shared memory, multiprocessor commonly and often implicitly assumed by programmers is that of sequential consistency. This model guarantees that all memory ac...
Sarita V. Adve, Mark D. Hill
EP
1998
Springer
15 years 8 months ago
Memory Scalability in Constraint-Based Multimedia Style Sheet Systems
Abstract. Multimedia style sheet systems uniformly use a constraintbased model of layout. Constraints provide a uniform mechanism for all aspects of style management and layout and...
Terry Cumaranatunge, Ethan V. Munson
IWMM
1998
Springer
115views Hardware» more  IWMM 1998»
15 years 8 months ago
One-Bit Counts between Unique and Sticky
Stoye's one-bit reference tagging scheme can be extended to local counts of two or more via two strategies. The first, suited to pure register transactions, is a cache of ref...
David J. Roth, David S. Wise
HIPS
1997
IEEE
15 years 8 months ago
Complexity and Performance in Parallel Programming Languages
Several parallel programming languages, libraries and environments have been developed to ease the task of writing programs for multiprocessors. Proponents of each approach often ...
Steven P. Vanderwiel, Daphna Nathanson, David J. L...
« Prev « First page 1169 / 1308 Last » Next »