Sciweavers

1114 search results - page 38 / 223
» Validating optimizations of concurrent C C programs
Sort
View
IPCO
2008
136views Optimization» more  IPCO 2008»
13 years 10 months ago
Computing with Multi-row Gomory Cuts
Recent advances on the understanding of valid inequalities from the infinite group relaxation has opened the possibility of finding a computationally effective extension to GMI cu...
Daniel G. Espinoza
APLAS
2010
ACM
13 years 9 months ago
A Logical Mix of Approximation and Separation
We extract techniques developed in the Concurrent C minor project to build a framework for constructing logics that contain approximation and/or separation. Approximation occurs wh...
Aquinas Hobor, Robert Dockins, Andrew W. Appel
ICCD
2004
IEEE
122views Hardware» more  ICCD 2004»
14 years 5 months ago
Linear Programming based Techniques for Synthesis of Network-on-Chip Architectures
Network-on-chip (NoC) has been proposed as a solution for the communication challenges of System-on-chip (SoC) design in the nanoscale regime. SoC design offers the opportunity fo...
Krishnan Srinivasan, Karam S. Chatha, Goran Konjev...
MOBISYS
2008
ACM
14 years 8 months ago
Composcan: adaptive scanning for efficient concurrent communications and positioning with 802.11
Using 802.11 concurrently for communications and positioning is problematic, especially if location-based services (e.g., indoor navigation) are concurrently executed with real-ti...
Mikkel Baun Kjærgaard, Thomas King
IEEEPACT
2009
IEEE
13 years 6 months ago
Adaptive Locks: Combining Transactions and Locks for Efficient Concurrency
Transactional memory is being advanced as an alternative to traditional lock-based synchronization for concurrent programming. Transactional memory simplifies the programming mode...
Takayuki Usui, Reimer Behrends, Jacob Evans, Yanni...