Multiprocessor algorithms for relational-database operators on hypercube systems
- George Mason Univ., Fairfax, VA (USA)
Exploiting parallelism in database processing has been a research goal since the early 1970s. Originally, special-purpose architectures were developed to provide the computational and input/output bandwidth needed for database processing. More recently, many researchers have relied on commercial multiprocessor and local area networked systems to improve database processing performance. This paper focuses on hypercube interconnected architectures as a computational engine for relational-database processing. Like other architectures with distributed memory and resources shared-nothing architectures, hypercube systems can support the high I/O bandwidth required for database processing. However, unlike the other architectures, hypercubes are scalable to thousands of nodes.
- OSTI ID:
- 5692940
- Journal Information:
- Computer; (USA), Journal Name: Computer; (USA) Vol. 23:11; ISSN 0018-9162; ISSN CPTRB
- Country of Publication:
- United States
- Language:
- English
Similar Records
Hypercube multiprocessors 1986
Parallel and fault-tolerant algorithms for hypercube multiprocessors
Algorithm-based fault tolerance on a hypercube multiprocessor
Book
·
Tue Dec 31 23:00:00 EST 1985
·
OSTI ID:6055870
Parallel and fault-tolerant algorithms for hypercube multiprocessors
Thesis/Dissertation
·
Thu Dec 31 23:00:00 EST 1987
·
OSTI ID:5921851
Algorithm-based fault tolerance on a hypercube multiprocessor
Journal Article
·
Sat Sep 01 00:00:00 EDT 1990
· IEEE Transactions on Computers (Institute of Electrical and Electronics Engineers); (USA)
·
OSTI ID:6569965