1686 search results - page 133 / 338 » Programs as polygraphs: computability and complexity |
133
Voted
POPL
2000
ACM
15 years 8 months ago
2000
ACM
Distributed-memory programs are often written using a global address space: any process can name any memory location on any processor. Some languages completely hide the distincti...
148
Voted
ICDCS
1998
IEEE
15 years 7 months ago
1998
IEEE
Exceptions are one of the most pervasive problems in process support systems. In installations expected to handle a large number of processes, having exceptions is bound to be a n...
132
click to vote
EUROPAR
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Algorithmic Skeletons offer high-level abstractions for parallel programming based on recurrent parallelism patterns. Patterns can be combined and nested into more comple...
138
Voted
PEPM
2004
ACM
15 years 9 months ago
2004
ACM
Tracing computations is a widely used methodology for program debugging. Lazy languages, in particular, pose new demands on tracing techniques since following the actual trace of ...
122
click to vote
PDCAT
2009
Springer
15 years 10 months ago
2009
Springer
With the advent of multi-core processors, desktop application developers must finally face parallel computing and its challenges. A large portion of the computational load in a p...