Nothing Special   »   [go: up one dir, main page]

Singer, 2006 - Google Patents

Parallel resolution of the satisfiability problem: A survey

Singer, 2006

View PDF
Document ID
12396488647342552404
Author
Singer D
Publication year
Publication venue
Parallel combinatorial optimization

External Links

Snippet

The propositional Satisfiability problem (SAT) is one of the most studied in computer science since it was the first problem proven to be NP-complete by Cook in 1971. Nowadays, the Satisfiability problem evidences great practical importance in a wide range of disciplines …
Continue reading at citeseerx.ist.psu.edu (PDF) (other versions)

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRICAL DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for programme control, e.g. control unit
    • G06F9/06Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
    • G06F9/46Multiprogramming arrangements
    • G06F9/48Programme initiating; Programme switching, e.g. by interrupt
    • G06F9/4806Task transfer initiation or dispatching
    • G06F9/4843Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
    • G06F9/4881Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRICAL DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for programme control, e.g. control unit
    • G06F9/06Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
    • G06F9/46Multiprogramming arrangements
    • G06F9/50Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5061Partitioning or combining of resources
    • G06F9/5066Algorithms for mapping a plurality of inter-dependent sub-tasks onto a plurality of physical CPUs
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRICAL DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for programme control, e.g. control unit
    • G06F9/06Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
    • G06F9/46Multiprogramming arrangements
    • G06F9/50Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5005Allocation of resources, e.g. of the central processing unit [CPU] to service a request
    • G06F9/5027Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
    • G06F9/505Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals considering the load
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRICAL DIGITAL DATA PROCESSING
    • G06F15/00Digital computers in general; Data processing equipment in general
    • G06F15/16Combinations of two or more digital computers each having at least an arithmetic unit, a programme unit and a register, e.g. for a simultaneous processing of several programmes
    • G06F15/163Interprocessor communication
    • G06F15/173Interprocessor communication using an interconnection network, e.g. matrix, shuffle, pyramid, star, snowflake
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRICAL DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for programme control, e.g. control unit
    • G06F9/06Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
    • G06F9/46Multiprogramming arrangements
    • G06F9/52Programme synchronisation; Mutual exclusion, e.g. by means of semaphores; Contention for resources among tasks
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRICAL DIGITAL DATA PROCESSING
    • G06F8/00Arrangements for software engineering
    • G06F8/40Transformations of program code
    • G06F8/41Compilation
    • G06F8/45Exploiting coarse grain parallelism in compilation, i.e. parallelism between groups of instructions
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRICAL DIGITAL DATA PROCESSING
    • G06F8/00Arrangements for software engineering
    • G06F8/40Transformations of program code
    • G06F8/41Compilation
    • G06F8/44Encoding
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50Computer-aided design
    • G06F17/5009Computer-aided design using simulation
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRICAL DIGITAL DATA PROCESSING
    • G06F15/00Digital computers in general; Data processing equipment in general
    • G06F15/76Architectures of general purpose stored programme computers
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRICAL DIGITAL DATA PROCESSING
    • G06F11/00Error detection; Error correction; Monitoring
    • G06F11/30Monitoring
    • G06F11/34Recording or statistical evaluation of computer activity, e.g. of down time, of input/output operation; Recording or statistical evaluation of user activity, e.g. usability assessment
    • G06F11/3409Recording or statistical evaluation of computer activity, e.g. of down time, of input/output operation; Recording or statistical evaluation of user activity, e.g. usability assessment for performance assessment
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00Methods or arrangements for processing data by operating upon the order or content of the data handled

Similar Documents

Publication Publication Date Title
Ralphs et al. Parallel solvers for mixed integer linear optimization
Singer Parallel resolution of the satisfiability problem: A survey
Ouyang et al. Hardware/software partitioning for heterogenous mpsoc considering communication overhead
Bellettini et al. Distributed CTL model checking in the cloud
Grove Performance modelling of message-passing parallel programs
Vikranth et al. Topology aware task stealing for on-chip NUMA multi-core processors
Archibald Algorithmic skeletons for exact combinatorial search at scale
Jiang et al. A DAG Scheduling Scheme on Heterogeneous Computing Systems Using Tuple‐Based Chemical Reaction Optimization
Shih et al. Performance study of parallel programming on cloud computing environments using mapreduce
Ferreira et al. Hardware MPI message matching: Insights into MPI matching behavior to inform design
Khandelia et al. Contention-conscious transaction ordering in multiprocessor dsp systems
Barbieri et al. Exhaustive key search on clusters of gpus
Tirumalai et al. Using parallelization and hardware concurrency to improve the performance of a genetic algorithm
Liu et al. A systematic and realistic network-on-chip traffic modeling and generation technique for emerging many-core systems
Chin et al. Implementing and evaluating multithreaded triad census algorithms on the Cray XMT
Singer et al. Parallel resolution of the satisfiability problem (SAT) with OpenMP and MPI
Lewis et al. Parallel QBF solving with advanced knowledge sharing
De Martini Analysis of market data with noir: real world application and improvements of a streaming and batch processing framework
Abd El Khalek et al. On the parallelization of SAT solvers
Wu et al. Using MPI to execute a FuzzyCLIPS application in parallel in heterogeneous computing systems
Wu et al. Parallel hybrid genetic algorithm for sat problems based on OpenMP
Santos Optimal and efficient parallel tridiagonal solvers using direct methods
Emmot et al. Designing Heterogeneous Systems: Large Scale Architectural Exploration Via Simulation
Costa Penha et al. Gene regulatory accelerators on cloud FPGA
Bonilla et al. Introducing and exploiting hierarchical structural information