Sciweavers

835 search results - page 5 / 167
» On optimal slicing of parallel programs
Sort
View
ICSE
2004
IEEE-ACM
14 years 7 months ago
Using Compressed Bytecode Traces for Slicing Java Programs
Dynamic slicing is a well-known program debugging technique. Given a program P and input I, it finds all program statements which directly/indirectly affect the values of some var...
Tao Wang, Abhik Roychoudhury
ICPP
2008
IEEE
14 years 2 months ago
Taming Single-Thread Program Performance on Many Distributed On-Chip L2 Caches
This paper presents a two-part study on managing distributed NUCA (Non-Uniform Cache Architecture) L2 caches in a future manycore processor to obtain high singlethread program per...
Lei Jin, Sangyeun Cho
SIGSOFT
2002
ACM
14 years 8 months ago
Improving program slicing with dynamic points-to data
Program slicing is a potentially useful analysis for aiding program understanding. However, slices of even small programs are often too large to be generally useful. Imprecise poi...
Markus Mock, Darren C. Atkinson, Craig Chambers, S...
ADT
2005
13 years 7 months ago
On Multiple Slice Turbo Codes
: The main problem concerning the hardware implementation of turbo codes is the lack of parallelism in the MAP-based decoding algorithm. This paper proposes to overcome this proble...
David Gnaedig, Emmanuel Boutillon, Michel Jé...
CAGD
2002
102views more  CAGD 2002»
13 years 7 months ago
Optimal slicing of free-form surfaces
Many applications, such as contour machining, rapid prototyping, and reverse engineering by laser scanner or coordinate measuring machine, involve sampling of free-from surfaces a...
Tait S. Smith, Rida T. Farouki, Mohammad al-Kandar...