Singer, 2006 - Google Patents
Parallel resolution of the satisfiability problem: A surveySinger, 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 …
- 238000000034 method 0 abstract description 32
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for programme control, e.g. control unit
- G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
- G06F9/46—Multiprogramming arrangements
- G06F9/48—Programme initiating; Programme switching, e.g. by interrupt
- G06F9/4806—Task transfer initiation or dispatching
- G06F9/4843—Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
- G06F9/4881—Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for programme control, e.g. control unit
- G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5061—Partitioning or combining of resources
- G06F9/5066—Algorithms for mapping a plurality of inter-dependent sub-tasks onto a plurality of physical CPUs
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for programme control, e.g. control unit
- G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
- G06F9/5027—Allocation 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/505—Allocation 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
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F15/00—Digital computers in general; Data processing equipment in general
- G06F15/16—Combinations 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/163—Interprocessor communication
- G06F15/173—Interprocessor communication using an interconnection network, e.g. matrix, shuffle, pyramid, star, snowflake
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for programme control, e.g. control unit
- G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
- G06F9/46—Multiprogramming arrangements
- G06F9/52—Programme synchronisation; Mutual exclusion, e.g. by means of semaphores; Contention for resources among tasks
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F8/00—Arrangements for software engineering
- G06F8/40—Transformations of program code
- G06F8/41—Compilation
- G06F8/45—Exploiting coarse grain parallelism in compilation, i.e. parallelism between groups of instructions
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F8/00—Arrangements for software engineering
- G06F8/40—Transformations of program code
- G06F8/41—Compilation
- G06F8/44—Encoding
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/50—Computer-aided design
- G06F17/5009—Computer-aided design using simulation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F15/00—Digital computers in general; Data processing equipment in general
- G06F15/76—Architectures of general purpose stored programme computers
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/30—Monitoring
- G06F11/34—Recording 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/3409—Recording 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
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F7/00—Methods 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 |