Sciweavers

562 search results - page 63 / 113
» Concurrent Turing Machines
Sort
View
ANCS
2009
ACM
14 years 9 months ago
A lock-free, cache-efficient shared ring buffer for multi-core architectures
We propose MCRingBuffer, a lock-free, cache-efficient shared ring buffer that provides fast data accesses among threads running in multi-core architectures. MCRingBuffer seeks to ...
Patrick P. C. Lee, Tian Bu, Girish P. Chandranmeno...
JLP
2007
89views more  JLP 2007»
14 years 11 months ago
Universality and semicomputability for nondeterministic programming languages over abstract algebras
tract Algebras Wei Jiang∗ , Yuan Wang† , and Jeffery Zucker‡ September 11, 2006 The Universal Function Theorem (UFT) originated in 1930s with the work of Alan Turing, who p...
Wei Jiang, Yuan Wang, Jeffery I. Zucker
SODA
2008
ACM
93views Algorithms» more  SODA 2008»
15 years 1 months ago
Fast load balancing via bounded best response
It is known that the dynamics of best response in an environment of non-cooperative users may converge to a good solution when users play sequentially, but may cycle far away from...
Baruch Awerbuch, Yossi Azar, Rohit Khandekar
ENTCS
2008
90views more  ENTCS 2008»
14 years 12 months ago
Instantaneous Transitions in Esterel
Esterel is an imperative synchronous programming language for the specification of deterministic concurrent reactive systems. While providing the usual control-flow constructs--se...
Olivier Tardieu, Stephen A. Edwards
SC
1995
ACM
15 years 3 months ago
Communication Optimizations for Parallel Computing Using Data Access Information
Given the large communication overheads characteristic of modern parallel machines, optimizations that eliminate, hide or parallelize communication may improve the performance of ...
Martin C. Rinard