114 search results - page 15 / 23 » Dynamic Dependency Analysis of Ordinary Programs |
APSEC
1998
IEEE
13 years 11 months ago
1998
IEEE
Modified programs are required to be retested to determine whether changes have been made correctly and to investigate whether those cause any adverse effect on the program behavi...
ENTCS
2002
13 years 7 months ago
2002
Abstract: Alias analysis for Fortran is less complicated than for programming languages with pointers but many real Fortran programs violate the standard: a formal parameter or a c...
PPOPP
1999
ACM
13 years 11 months ago
1999
ACM
Divide and conquer algorithms are a good match for modern parallel machines: they tend to have large amounts of inherent parallelism and they work well with caches and deep memory...
SC
2009
ACM
14 years 2 months ago
2009
ACM
This paper presents a dynamic task scheduling approach to executing dense linear algebra algorithms on multicore systems (either shared-memory or distributed-memory). We use a tas...
CAL
2006
13 years 7 months ago
2006
Instruction-level traces are widely used for program and hardware analysis. However, program traces for just a few seconds of execution are enormous, up to several terabytes in siz...