273 search results - page 41 / 55 » Improving program slicing with dynamic points-to data |
IPPS
1996
IEEE
15 years 1 months ago
1996
IEEE
PVM and other distributed computing systems have enabled the use of networks of workstations for parallel computation, but their approach of treating all networks as collections o...
88
Voted
CLUSTER
2009
IEEE
15 years 1 months ago
2009
IEEE
Abstract--This paper proposes an analytical model to estimate the cost of running an affinity-based thread schedule on multicore systems. The model consists of three submodels to e...
ASAP
2007
IEEE
15 years 4 months ago
2007
IEEE
We present a memory efficient, practical, systolic, parallel architecture for the complete 0/1 knapsack dynamic programming problem, including backtracking. This problem was inte...
ACMICEC
2004
ACM
15 years 3 months ago
2004
ACM
This paper presents a loosely coupled service-composition paradigm. This paradigm employs a distributed data flow that differs markedly from centralized information flow adopted b...
ACMMSP
2005
ACM
15 years 3 months ago
2005
ACM
64-bit address spaces are increasingly important for modern applications, but they come at a price: pointers use twice as much memory, reducing the effective cache capacity and m...