Sciweavers

273 search results - page 17 / 55
» Improving program slicing with dynamic points-to data
Sort
View
IPPS
1996
IEEE
15 years 1 months ago
Practical Parallel Algorithms for Dynamic Data Redistribution, Median Finding, and Selection
A common statistical problem is that of nding the median element in a set of data. This paper presents a fastand portable parallel algorithm for nding the median given a set of el...
David A. Bader, Joseph JáJá
JSS
2010
107views more  JSS 2010»
14 years 8 months ago
An empirical investigation into branch coverage for C programs using CUTE and AUSTIN
Automated test data generation has remained a topic of considerable interest for several decades because it lies at the heart of attempts to automate the process of Software Testi...
Kiran Lakhotia, Phil McMinn, Mark Harman
CASES
2008
ACM
14 years 11 months ago
Efficient code caching to improve performance and energy consumption for java applications
Java applications rely on Just-In-Time (JIT) compilers or adaptive compilers to generate and optimize binary code at runtime to boost performance. In conventional Java Virtual Mac...
Yu Sun, Wei Zhang
SIGARCH
2010
91views more  SIGARCH 2010»
14 years 4 months ago
Programming framework for clusters with heterogeneous accelerators
We describe a programming framework for high performance clusters with various hardware accelerators. In this framework, users can utilize the available heterogeneous resources pr...
Kuen Hung Tsoi, Anson H. T. Tse, Peter Pietzuch, W...
SC
1995
ACM
15 years 1 months ago
I/O Limitations in Parallel Molecular Dynamics
Abstract We discuss data production rates and their impact on the performance of scientific applications using parallel computers. On one hand, too high rates of data production c...
Terry W. Clark, L. Ridgway Scott, Stanislaw Wloked...