Sciweavers

6248 search results - page 302 / 1250
» Programming in a data factory
Sort
View
SC
1995
ACM
15 years 10 months ago
Communication Optimizations for Parallel Computing Using Data Access Information
Given the large communication overheads characteristic of modern parallel machines, optimizations that eliminate, hide or parallelize communication may improve the performance of ...
Martin C. Rinard
196
Voted
ASPLOS
2008
ACM
15 years 8 months ago
Optimistic parallelism benefits from data partitioning
Recent studies of irregular applications such as finite-element mesh generators and data-clustering codes have shown that these applications have a generalized data parallelism ar...
Milind Kulkarni, Keshav Pingali, Ganesh Ramanaraya...
CORR
2008
Springer
158views Education» more  CORR 2008»
15 years 6 months ago
Declarative Combinatorics: Isomorphisms, Hylomorphisms and Hereditarily Finite Data Types in Haskell
This paper is an exploration in a functional programming framework of isomorphisms between elementary data types (natural numbers, sets, finite functions, permutations binary deci...
Paul Tarau
POPL
2004
ACM
16 years 7 months ago
Separation and information hiding
We investigate proof rules for information hiding, using the recent formalism of separation logic. In essence, we use the separating conjunction to partition the internal resource...
Peter W. O'Hearn, Hongseok Yang, John C. Reynolds
144
Voted
SIGCSE
2005
ACM
80views Education» more  SIGCSE 2005»
16 years 8 days ago
PL-detective: experiences and results
Last year we described the PL-Detective, a system for building exercises and demonstrations in a programming languages course. One of the main goals of the PL-Detective was to pro...
Amer Diwan, Michele H. Jackson, William M. Waite, ...