[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

Sanders, 1995 - Google Patents

Fast priority queues for parallel branch-and-bound

Sanders, 1995

View PDF
Document ID
4514243708162410850
Author
Sanders P
Publication year
Publication venue
Parallel Algorithms for Irregularly Structured Problems: Second International Workshop, IRREGULAR'95 Lyon, France, September 4–6, 1995 Proceedings 2

External Links

Snippet

Currently used parallel best first branch-and-bound algorithms either suffer from contention at a centralized priority queue or can only approximate the best first strategy. Bottleneck free algorithms for parallel priority queues are known but they cannot be implemented very …
Continue reading at citeseerx.ist.psu.edu (PDF) (other versions)

Classifications

    • 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/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
    • G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
    • 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
    • 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]
    • 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/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
    • G06F17/30386—Retrieval requests
    • 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/44—Arrangements for executing specific programmes
    • G06F9/4421—Execution paradigms
    • 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/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/3074—Audio data retrieval
    • G06F17/30778—Audio database index structures and management thereof
    • 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
    • G06F7/22—Arrangements for sorting or merging computer data on continuous record carriers, e.g. tape, drum, disc
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F12/00—Accessing, addressing or allocating within memory systems or architectures
    • G06F12/02—Addressing or allocation; Relocation
    • 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
    • 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
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F2207/00—Indexing scheme relating to methods or arrangements for processing data by operating upon the order or content of the data handled

Similar Documents

Publication Publication Date Title
Blelloch et al. A comparison of sorting algorithms for the connection machine CM-2
Thorup Integer priority queues with decrease key in constant time and the single source shortest paths problem
US6263331B1 (en) Hybrid hash join process
Lee et al. Partitioned parallel radix sort
EP0516266A2 (en) Merging sorted lists
Sanders Randomized priority queues for fast parallel access
Blelloch et al. An experimental analysis of parallel sorting algorithms
Hightower et al. Implementations of randomized sorting on large parallel machines
US5367677A (en) System for iterated generation from an array of records of a posting file with row segments based on column entry value ranges
Shen et al. GPU‐based branch‐and‐bound method to solve large 0‐1 knapsack problems with data‐centric strategies
Brungger et al. Joining forces in solving large-scale quadratic assignment problems in parallel
Sanders Fast priority queues for parallel branch-and-bound
Mamun et al. An efficient minimum spanning tree algorithm
Ajwani et al. A topological sorting algorithm for large graphs
Durad et al. Performance analysis of parallel sorting algorithms using MPI
CN108334532B (en) A Spark-based Eclat parallelization method, system and device
Monien et al. A Local Graph Partitioning Heuristic Meeting Bisection Bounds.
Suresh et al. Performance analysis of various combination sorting algotirthms for large dataset to fit to a multi-core architecture
BÄumker et al. Realistic parallel algorithms: Priority queue operations and selection for the BSP* model
Vignesh et al. Merge sort enhanced in place sorting algorithm
Hopp et al. Parallel game tree search on SIMD machines
Lee et al. Partitioned parallel radix sort
Gupta Comparison and enhancement of sorting algorithms
Gil-Costa et al. An empirical evaluation of a distributed clustering-based index for metric space databases
Gerbessiotis et al. A new randomized sorting algorithm on the BSP model