Sciweavers

1720 search results - page 156 / 344
» Unranking Combinations in Parallel
Sort
View
DATE
2008
IEEE
105views Hardware» more  DATE 2008»
15 years 10 months ago
Comparison of Boolean Satisfiability Encodings on FPGA Detailed Routing Problems
We compare 12 new encodings for representing of FPGA detailed routing problems as equivalent Boolean Satisfiability (SAT) problems against the only 2 previously used encodings. We...
Miroslav N. Velev, Ping Gao 0002
IPPS
2005
IEEE
15 years 9 months ago
Automatic Support for Irregular Computations in a High-Level Language
The problem of writing high performance parallel applications becomes even more challenging when irregular, sparse or adaptive methods are employed. In this paper we introduce com...
Jimmy Su, Katherine A. Yelick
CCGRID
2001
IEEE
15 years 7 months ago
Cluster Computing in the Classroom: Topics, Guidelines, and Experiences
- With the progress of research on cluster computing, more and more universities have begun to offer various courses covering cluster computing. A wide variety of content can be ta...
Amy W. Apon, Rajkumar Buyya, Hai Jin, Jens Mache
ICDE
2010
IEEE
167views Database» more  ICDE 2010»
15 years 4 months ago
Top-k pipe join
Abstract—In the context of service composition and orchestration, service invocation is typically scheduled according to execution plans, whose topology establishes whether diffe...
Davide Martinenghi, Marco Tagliasacchi
HOTI
2005
IEEE
15 years 9 months ago
Addressing Queuing Bottlenecks at High Speeds
Modern routers and switch fabrics can have hundreds of input and output ports running at up to 10 Gb/s; 40 Gb/s systems are starting to appear. At these rates, the performance of ...
Sailesh Kumar, Jonathan S. Turner, Patrick Crowley