Skip to main navigation
Skip to search
Skip to main content
New Jersey Institute of Technology Home
Help & FAQ
Home
Profiles
Research units
Facilities
Federal Grants
Research output
Press/Media
Search by expertise, name or affiliation
Evaluating arithmetic expressions using tree contraction: A fast and scalable parallel implementation for symmetric multiprocessors (SMPs)
David A. Bader
, Sukanya Sreshta
, Nina R. Weisse-Bernstein
Research output
:
Chapter in Book/Report/Conference proceeding
›
Conference contribution
24
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Evaluating arithmetic expressions using tree contraction: A fast and scalable parallel implementation for symmetric multiprocessors (SMPs)'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Algorithmic Approach
50%
Arithmetic Expressions
100%
Bridging the Gap
50%
Combinatorial Problems
100%
Expression Tree
50%
First-ever
50%
Large Classes
50%
Linear Speedup
50%
Memory Access
50%
Parallel Computer
50%
Parallel Implementation
100%
PRAM Algorithms
100%
Ranking List
50%
Sequential Implementation
50%
Shared Memory
50%
Shared Memory Algorithms
50%
Shared Memory Parallel Algorithm
50%
Symmetric multiprocessor
100%
Tree Contraction
100%
Computer Science
Arithmetic Expression
100%
Combinatorial Problem
66%
Expression Tree
33%
Linear Speedup
33%
Memory Access
33%
Parallel Algorithms
33%
Parallel Computer
33%
Parallel Implementation
100%
Sequential Implementation
33%
Shared Memories
100%
Symmetric Multi-Processor
100%