Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2015

Highly Cited

2015

We present Grappa, a modern take on software distributed shared memory (DSM) for in-memory data-intensive applications. Grappa… Expand

Is this relevant?

2012

2012

Speedups demonstrated for finding the biconnected components of a graph: 9x to 33x on the Explicit Multi-Threading (XMT) many… Expand

Is this relevant?

2007

2007

Programs with irregular patterns of dynamic data structures and/or those with complicated control structures such as recursion… Expand

Is this relevant?

Highly Cited

2005

Highly Cited

2005

Combinatorial problems such as those from graph theory pose serious challenges for parallel machines due to non-contiguous… Expand

Is this relevant?

2004

2004

Irregular problems such as those from graph theory pose serious challenges for parallel machines due to non-contiguous accesses… Expand

Is this relevant?

2003

2003

Large-scale parallel discrete event simulations of massive networks, such as the Internet, are "Grand Challenge" problems: packet… Expand

Is this relevant?

Highly Cited

2002

Highly Cited

2002

The conjugate gradient (CG) algorithm is perhaps the best-known iterative technique for solving sparse linear systems that are… Expand

Is this relevant?

2001

2001

Finite difference, time domain (FDTD) simulations are important to the design cycle for optical communications devices. High… Expand

Is this relevant?

2001

2001

This paper describes research in exploiting loop-level parallelism on a simultaneous multithreading processor. We discuss some… Expand

Is this relevant?

2000

2000

The Cray MTA, a multithreaded architecture, is a new parallel supercomputer installed at San Diego Supercomputer Center (SDSC… Expand

Is this relevant?