Sciweavers

1951 search results - page 278 / 391
» An algorithm for improving graph partitions
Sort
View
PVLDB
2011
14 years 7 months ago
CoHadoop: Flexible Data Placement and Its Exploitation in Hadoop
Hadoop has become an attractive platform for large-scale data analytics. In this paper, we identify a major performance bottleneck of Hadoop: its lack of ability to colocate relat...
Mohamed Y. Eltabakh, Yuanyuan Tian, Fatma Özc...
IEEEPACT
2006
IEEE
15 years 10 months ago
Fast, automatic, procedure-level performance tuning
This paper presents an automated performance tuning solution, which partitions a program into a number of tuning sections and finds the best combination of compiler options for e...
Zhelong Pan, Rudolf Eigenmann
ISPAN
1997
IEEE
15 years 8 months ago
On The Shuffle-Exchange Permutation Network
The shuffle-exchange permutation network (SEPn) is a fixed degree Cayley graph which has been proposed as a basis for massively parallel systems. We propose a routing algorithm wi...
Douglas W. Bass, Ivan Hal Sudborough
SOFSEM
2007
Springer
15 years 10 months ago
Exact Max 2-Sat: Easier and Faster
Prior algorithms known for exactly solving Max 2-Sat improve upon the trivial upper bound only for very sparse instances. We present new algorithms for exactly solving (in fact, c...
Martin Fürer, Shiva Prasad Kasiviswanathan
PLDI
2009
ACM
15 years 11 months ago
Snugglebug: a powerful approach to weakest preconditions
Symbolic analysis shows promise as a foundation for bug-finding, specification inference, verification, and test generation. This paper addresses demand-driven symbolic analysi...
Satish Chandra, Stephen J. Fink, Manu Sridharan