208 search results - page 30 / 42 » Highly dependable concurrent programming using design for ve... |
94
Voted
HPCA
2007
IEEE
16 years 24 days ago
2007
IEEE
Transactional Memory (TM) provides mechanisms that promise to simplify parallel programming by eliminating the need for locks and their associated problems (deadlock, livelock, pr...
116
click to vote
HPCA
2011
IEEE
14 years 4 months ago
2011
IEEE
As the web becomes the platform of choice for execution of more complex applications, a growing portion of computation is handed off by developers to the client side to reduce net...
105
Voted
ICSE
2008
IEEE-ACM
16 years 1 months ago
2008
IEEE-ACM
Dynamically discovering likely program invariants from concrete test executions has emerged as a highly promising software engineering technique. Dynamic invariant inference has t...
91
Voted
ICSE
2009
IEEE-ACM
16 years 1 months ago
2009
IEEE-ACM
Designers of concurrent programs are faced with many choices of synchronization mechanisms, among which clear functional trade-offs exist. Making synchronization customizable is h...
116
click to vote
ISSAC
2007
Springer
15 years 6 months ago
2007
Springer
Partitioned Global Address Space (PGAS) languages combine the programming convenience of shared memory with the locality and performance control of message passing. One such langu...