Sciweavers

544 search results - page 83 / 109
» What cannot be computed locally!
Sort
View
FCSC
2010
170views more  FCSC 2010»
13 years 6 months ago
Formal verification of concurrent programs with read-write locks
Abstract Read-write locking is an important mechanism to improve concurrent granularity, but it is difficult to reason about the safety of concurrent programs with read-write locks...
Ming Fu, Yu Zhang, Yong Li
RIVF
2003
13 years 10 months ago
Airspace Sectorization By Constraint Programming
—In this paper we consider the Airspace Sectorization Problem (ASP) where airspace has to be partitioned into a number of sectors, each sector being assigned to a team of air tra...
Huy Trandac, Philippe Baptiste, Vu Duong

Publication
351views
15 years 9 months ago
Synthesizable High Level Hardware Descriptions
Modern hardware description languages support code-generation constructs like generate/endgenerate in Verilog. These constructs are intended to describe regular or parameterized ha...
Jennifer Gillenwater, Gregory Malecha, Cherif Sala...
ASPLOS
2009
ACM
14 years 9 months ago
Producing wrong data without doing anything obviously wrong!
This paper presents a surprising result: changing a seemingly innocuous aspect of an experimental setup can cause a systems researcher to draw wrong conclusions from an experiment...
Todd Mytkowicz, Amer Diwan, Matthias Hauswirth, Pe...
PODC
2009
ACM
14 years 9 months ago
Load balancing without regret in the bulletin board model
We analyze the performance of protocols for load balancing in distributed systems based on no-regret algorithms from online learning theory. These protocols treat load balancing a...
Éva Tardos, Georgios Piliouras, Robert D. K...