NDLI: Transitive closure: an experimental case study of three multithreaded database algorithms on a shared memory multiprocessor

Content Provider	IEEE Xplore Digital Library
Author	Young-Myers, H. Raschid, L.
Copyright Year	1993
Description	Author affiliation: Maryland Univ., College Park, MD, USA (Young-Myers, H.; Raschid, L.)
Abstract	An experimental performance evaluation of three multithreaded database transitive closure algorithms on a shared memory multiprocessor is described. The algorithms are differentiated on the basis of the dataflow patterns among the threads, namely no dataflow, pipelined dataflow, and network dataflow. Close to linear speedup is achieved by the no dataflow algorithm when there is sufficiently large workload, and sufficient primary memory for processing. Even when communication is through shared memory, the no dataflow algorithm performs significantly better than the algorithms with dataflow. When access to each package of memory is shared by multiple threads, the number of threads significantly affects the performance of the algorithms in limited primary memory. When each page is exclusively accessed by a single thread, performance remains constant when the number of threads is varied.
Starting Page	255
Ending Page	259
File Size	509596
Page Count	5
File Format	PDF
ISBN	0818633301
DOI	10.1109/PDIS.1993.253085
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1993-01-20
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Computer aided software engineering Yarn Algorithm design and analysis Iterative algorithms Partitioning algorithms Information systems Hardware Educational institutions Database systems Computational complexity
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Processing the transitive-closure logic rules on shared-nothing multiprocessor systems

Multiprocessor Transitive Closure Algorithms

An iterative greedy algorithm for hardware/software partitioning

Research on k-means Clustering Algorithm: An Improved k-means Clustering Algorithm

Customising application-specific multiprocessor systems: a case study

Using Aggressor Thread Information to Improve Shared Cache Management for CMPs

Computer-Aided Partitioning of Behavioral Hardware Descriptions

PPS-a parallel partition sort algorithm for multiprocessor database systems

Multiprocessor-Based Placement by Simulated Annealing

Transitive closure: an experimental case study of three multithreaded database algorithms on a shared memory multiprocessor

Similar Documents

Processing the transitive-closure logic rules on shared-nothing multiprocessor systems

Multiprocessor Transitive Closure Algorithms

An iterative greedy algorithm for hardware/software partitioning

Research on k-means Clustering Algorithm: An Improved k-means Clustering Algorithm

Customising application-specific multiprocessor systems: a case study

Using Aggressor Thread Information to Improve Shared Cache Management for CMPs

Computer-Aided Partitioning of Behavioral Hardware Descriptions

PPS-a parallel partition sort algorithm for multiprocessor database systems

Multiprocessor-Based Placement by Simulated Annealing

Transitive closure: an experimental case study of three multithreaded database algorithms on a shared memory multiprocessor