Sciweavers

1024 search results - page 26 / 205
» Complexity and Performance in Parallel Programming Languages
Sort
View
ASPLOS
2006
ACM
14 years 2 months ago
Accelerator: using data parallelism to program GPUs for general-purpose uses
GPUs are difficult to program for general-purpose uses. Programmers can either learn graphics APIs and convert their applications to use graphics pipeline operations or they can ...
David Tarditi, Sidd Puri, Jose Oglesby
MICRO
2006
IEEE
191views Hardware» more  MICRO 2006»
13 years 8 months ago
CAPSULE: Hardware-Assisted Parallel Execution of Component-Based Programs
Since processor performance scalability will now mostly be achieved through thread-level parallelism, there is a strong incentive to parallelize a broad range of applications, inc...
Pierre Palatin, Yves Lhuillier, Olivier Temam
EUROPAR
2003
Springer
14 years 1 months ago
Why Not Use a Pattern-Based Parallel Programming System?
Parallel programming is seen as an effective technique to improve the performance of computationally-intensive programs. This is done at the cost of increasing the complexity of t...
John Anvik, Jonathan Schaeffer, Duane Szafron, Kai...
ICLP
1997
Springer
14 years 24 days ago
Parallel Evaluation Strategies for Functional Logic Languages
We introduce novel, sound, complete, and locally optimal evaluation strategies for functional logic programming languages. Our strategies combine, in a non-trivial way, two landma...
Sergio Antoy, Rachid Echahed, Michael Hanus
IPPS
2002
IEEE
14 years 1 months ago
Achieving Scalability in Parallel Tabled Logic Programs
Tabling or memoing is a technique where one stores intermediate answers to a problem so that they can be reused in further calls. Tabling is of interest to logic programming becau...
Ricardo Rocha, Fernando M. A. Silva, Vítor ...