منابع مشابه
An iterative solver benchmark
In scientific computing, several benchmarks exist that give a user some idea of the to-be-expected performance given a code and a specific computer. One widely accepted performance measurement is the Linpack benchmark [4], which evaluates the efficiency with which a machine can solve a dense system of equations. Since this operation allows for considerable reuse of data, it is possible to show ...
متن کاملIterative Solver Benchmark
The traditional performance measurement for computers on scienti c application has been the Linpack benchmark [2], which evaluates the e ciency with which a machine can solve a dense system of equations. Since this operation allows for considerable reuse of data, it is possible to show performance gures a sizeable percentage of peak performance, even for machines with a severe unbalance between...
متن کاملSolver and Benchmark Descriptions
We improve abcdSAT by a new various scoring Scheme. AbcdSAT is a SAT solver built on the top of Glucose 2.3 [5]. The existing Glucose has no inprocess. Nevertheless, here we add various inprocesses to AbcdSAT. According to the rule of different tracks at the SAT Competition 2017, we develop multple versions of abcdSAT, which are submitted to agile, main, no-limit, incremental library and parall...
متن کاملSAT COMPETITION 2017 Solver and Benchmark Descriptions
We improve abcdSAT by a new various scoring Scheme. AbcdSAT is a SAT solver built on the top of Glucose 2.3 [5]. The existing Glucose has no inprocess. Nevertheless, here we add various inprocesses to AbcdSAT. According to the rule of different tracks at the SAT Competition 2017, we develop multple versions of abcdSAT, which are submitted to agile, main, no-limit, incremental library and parall...
متن کاملThe Iterative Solver Template Library
The numerical solution of partial differential equations frequently requires the solution of large and sparse linear systems. Using generic programming techniques like in C++ one can create solver libraries that allow efficient realization of “fine grained interfaces”, i. e. with functions consisting only of a few lines, like access to individual matrix entries. This prevents code replication a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientific Programming
سال: 2001
ISSN: 1058-9244,1875-919X
DOI: 10.1155/2001/527931