Sciweavers

209 search results - page 6 / 42
» Using Run-Time Data for Program Comprehension
Sort
View
LCPC
1994
Springer
13 years 12 months ago
Optimizing Array Distributions in Data-Parallel Programs
Data parallel programs are sensitive to the distribution of data across processor nodes. We formulate the reduction of inter-node communication as an optimization on a colored gra...
Krishna Kunchithapadam, Barton P. Miller
ASPLOS
2006
ACM
13 years 11 months ago
Comprehensively and efficiently protecting the heap
The goal of this paper is to propose a scheme that provides comprehensive security protection for the heap. Heap vulnerabilities are increasingly being exploited for attacks on co...
Mazen Kharbutli, Xiaowei Jiang, Yan Solihin, Guru ...
ICCS
2004
Springer
14 years 1 months ago
Routing and Wavelength Assignments in Optical WDM Networks with Maximum Quantity of Edge Disjoint Paths
In the present paper routing and wavelength assignment (RWA) in optical WDM networks is discussed. Previous techniques on based on the integer linear programming and graph coloring...
Hyunseung Choo, Vladimir V. Shakhov
BMCBI
2008
195views more  BMCBI 2008»
13 years 8 months ago
Goldsurfer2 (Gs2): A comprehensive tool for the analysis and visualization of genome wide association studies
Background: Genome wide association (GWA) studies are now being widely undertaken aiming to find the link between genetic variations and common diseases. Ideally, a well-powered G...
Fredrik Pettersson, Andrew P. Morris, Michael R. B...
ASPLOS
2006
ACM
14 years 1 months ago
AVIO: detecting atomicity violations via access interleaving invariants
Concurrency bugs are among the most difficult to test and diagnose of all software bugs. The multicore technology trend worsens this problem. Most previous concurrency bug detect...
Shan Lu, Joseph Tucek, Feng Qin, Yuanyuan Zhou