544 search results - page 69 / 109 » Testing concurrent programs using value schedules |
PPOPP
2010
ACM
15 years 7 months ago
2010
ACM
We present Lazy Binary Splitting (LBS), a user-level scheduler of nested parallelism for shared-memory multiprocessors that builds on existing Eager Binary Splitting work-stealing...
PLDI
2009
ACM
15 years 4 months ago
2009
ACM
Data races are one of the most common and subtle causes of pernicious concurrency bugs. Static techniques for preventing data races are overly conservative and do not scale well t...
103
click to vote
ICCAD
1999
IEEE
15 years 2 months ago
1999
IEEE
We consider the problem of finding an optimal clock schedule, i.e. optimal arrival times for clock signals at latches of a VLSI chip. We describe a general model which includes al...
CHI
2007
ACM
15 years 10 months ago
2007
ACM
We present the case study of a complex, mixed-initiative scheduling system to illustrate Work-Centered Design (WCD), a new approach for the design of information systems. WCD is b...
IOLTS
2002
IEEE
15 years 2 months ago
2002
IEEE
This paper proposes a new solution for the diagnosis of faults into embedded RAMs, currently under evaluation within STMicroelectronics. The proposed scheme uses dedicated circuit...