Sciweavers

3660 search results - page 527 / 732
» Parallel Program Archetypes
Sort
View
ISCA
2009
IEEE
137views Hardware» more  ISCA 2009»
16 years 1 months ago
A case for an interleaving constrained shared-memory multi-processor
Shared-memory multi-threaded programming is inherently more difficult than single-threaded programming. The main source of complexity is that, the threads of an application can in...
Jie Yu, Satish Narayanasamy
CP
2005
Springer
16 years 3 days ago
Planning and Scheduling to Minimize Tardiness
We combine mixed integer linear programming (MILP) and constraint programming (CP) to minimize tardiness in planning and scheduling. Tasks are allocated to facilities using MILP an...
John N. Hooker
OOPSLA
2004
Springer
15 years 12 months ago
Transparent proxies for java futures
A proxy object is a surrogate or placeholder that controls access to another target object. Proxies can be used to support distributed programming, lazy or parallel evaluation, ac...
Polyvios Pratikakis, Jaime Spacco, Michael W. Hick...
PLDI
1997
ACM
15 years 10 months ago
Dynamic Feedback: An Effective Technique for Adaptive Computing
This paper presents dynamic feedback, a technique that enables computations to adapt dynamically to different execution environments. A compiler that uses dynamic feedback produce...
Pedro C. Diniz, Martin C. Rinard
PLDI
1995
ACM
15 years 10 months ago
Unifying Data and Control Transformations for Distributed Shared Memory Machines
We present a unified approach to locality optimization that employs both data and control transformations. Data transformations include changing the array layout in memory. Contr...
Michal Cierniak, Wei Li