Efficient Parallel Data Structures for Fine-Grained Hypercube Multiprocessors.

doi 10.22215/etd/1990-01707
Full Text
Abstract

Available in full text

Date

Unknown

Authors
Publisher

Carleton University

Related search

A Multicast Algorithm for Hypercube Multiprocessors

Parallel Algorithms and Applications
1994English

Coarse-Grained Thread Pipelining: A Speculative Parallel Execution Model for Shared-Memory Multiprocessors

IEEE Transactions on Parallel and Distributed Systems
HardwareComputational TheorySignal ProcessingArchitectureMathematics
2001English

Implementing Data Structures on a Hypercube Multiprocessor, and Applications in Parallel Computational Geometry

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1990English

Subcube Fault Tolerance in Hypercube Multiprocessors

IEEE Transactions on Computers
HardwareArchitectureMathematicsComputational TheoryTheoretical Computer ScienceSoftware
1995English

Fine-Grained Parallel Ant Colony System for Shared-Memory Architectures

International Journal of Computer Applications
2012English

Provably Efficient Scheduling for Languages With Fine-Grained Parallelism

1995English

I-Structures: Data Structures for Parallel Computing

ACM Transactions on Programming Languages and Systems
Software
1989English

A Fine-Grained Parallel Algorithm for the Cyclic Flexible Job Shop Problem

Archives of Control Sciences
2017English

Using Heterogeneous High Performance Computing Cluster for Supporting Fine-Grained Parallel Applications

2006English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy