Sciweavers

205 search results - page 20 / 41
» Engineering Planar Separator Algorithms
Sort
View
ISSTA
2010
ACM
14 years 9 months ago
Robust non-intrusive record-replay with processor extraction
With the advent of increasingly larger parallel machines, debugging is becoming more and more challenging. In particular, applications at this scale tend to behave non-determinist...
Filippo Gioachin, Gengbin Zheng, Laxmikant V. Kal&...
PLDI
1994
ACM
15 years 1 months ago
On Slicing Programs with Jump Statements
Programslices have potentialuses in manysoftware engineering applications. Traditional slicing algorithms, however, do not work correctly on programs that contain explicit jump st...
Hiralal Agrawal
AOSD
2007
ACM
15 years 1 months ago
Generating parallel applications for distributed memory systems using aspects, components, and patterns
Developing and debugging parallel programs particularly for distributed memory architectures is still a difficult task. The most popular approach to developing parallel programs f...
Purushotham V. Bangalore
PDP
2005
IEEE
15 years 3 months ago
Practicable Layouts for Optimal Circulant Graphs
Circulant graphs have been deeply studied in technical literature. Midimew networks are a class of distancerelated optimal circulant graphs of degree four which have applications ...
Enrique Vallejo, Ramón Beivide, Carmen Mart...
CAGD
2002
102views more  CAGD 2002»
14 years 9 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...