Sciweavers

1262 search results - page 106 / 253
» Techniques for obtaining high performance in Java programs
Sort
View
SC
2009
ACM
15 years 11 months ago
FACT: fast communication trace collection for parallel applications through program slicing
A proper understanding of communication patterns of parallel applications is important to optimize application performance and design better communication subsystems. Communicatio...
Jidong Zhai, Tianwei Sheng, Jiangzhou He, Wenguang...
ECOOPW
1998
Springer
15 years 9 months ago
The Matrix Template Library: A Unifying Framework for Numerical Linear Algebra
Abstract. We present a uni ed approach for expressing high performance numerical linear algebra routines for a class of dense and sparse matrix formats and shapes. As with the Stan...
Jeremy G. Siek, Andrew Lumsdaine
ORL
2011
14 years 12 months ago
Solving large Steiner Triple Covering Problems
Computing the 1-width of the incidence matrix of a Steiner Triple System gives rise to small set covering instances that provide a computational challenge for integer programming ...
James Ostrowski, Jeff Linderoth, Fabrizio Rossi, S...
TSE
2008
91views more  TSE 2008»
15 years 4 months ago
Privately Finding Specifications
Buggy software is a reality and automated techniques for discovering bugs are highly desirable. A specification describes the correct behavior of a program. For example, a file mus...
Westley Weimer, Nina Mishra
TOCS
2002
70views more  TOCS 2002»
15 years 4 months ago
Secure program partitioning
This paper presents secure program partitioning, a language-based technique for protecting confidential data during computation in distributed systems containing mutually untruste...
Steve Zdancewic, Lantian Zheng, Nathaniel Nystrom,...