Sciweavers

776 search results - page 14 / 156
» Language Constructs for Structured Parallel Programming
Sort
View
IEEEPACT
2009
IEEE
14 years 2 months ago
Interprocedural Load Elimination for Dynamic Optimization of Parallel Programs
Abstract—Load elimination is a classical compiler transformation that is increasing in importance for multi-core and many-core architectures. The effect of the transformation is ...
Rajkishore Barik, Vivek Sarkar
PPOPP
2011
ACM
12 years 10 months ago
Wait-free queues with multiple enqueuers and dequeuers
The queue data structure is fundamental and ubiquitous. Lockfree versions of the queue are well known. However, an important open question is whether practical wait-free queues ex...
Alex Kogan, Erez Petrank
IPPS
2000
IEEE
14 years 8 days ago
Solving Problems on Parallel Computers by Cellular Programming
Cellular automata can be used to design high-performance natural solvers on parallel computers. This paper describes the development of applications using CARPET, a high-level prog...
Domenico Talia
CONCUR
2006
Springer
13 years 11 months ago
Minimization, Learning, and Conformance Testing of Boolean Programs
Boolean programs with recursion are convenient abstractions of sequential imperative programs, and can be represented as recursive state machines (RSMs) or pushdown automata. Motiv...
Viraj Kumar, P. Madhusudan, Mahesh Viswanathan
POPL
2012
ACM
12 years 3 months ago
Analysis of recursively parallel programs
We propose a general formal model of isolated hierarchical parallel computations, and identify several fragments to match the concurrency constructs present in real-world programm...
Ahmed Bouajjani, Michael Emmi