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.

2012

2012

Predicting distributed application performance is a constant challenge to researchers, with an increased difficulty when… Expand

Is this relevant?

2005

2005

We present an optimal algorithm for sortingn integers in the range [1,nc] (for any constantc) for the EREW PRAM model where the… Expand

Is this relevant?

2004

2004

This paper considers integer sorting on a RAM. We show that adaptive sorting of a sequence with qn inversions is asymptotically… Expand

Is this relevant?

Highly Cited

1998

Highly Cited

1998

Previous schemes for sorting on general-purpose parallel machines have had to choose between poor load balancing and irregular… Expand

Is this relevant?

Highly Cited

1997

Highly Cited

1997

Sequential consistency is the most widely used correctness condition for multiprocessor memory systems. This paper studies the… Expand

Is this relevant?

Highly Cited

1995

Highly Cited

1995

Writing large-scale parallel and distributed scientific applications that make optimum use of the multiprocessor is a challenging… Expand

Is this relevant?

Highly Cited

1992

Highly Cited

1992

We show that <italic>n</italic> integers in the range 1..<italic>n</italic> can be stably sorted on an EREW PRAM using <italic>O… Expand

Is this relevant?

1990

1990

The problem of sorting n integers from a restricted range [1..m], where m is superpolynomial in n, is considered. An o(n log n… Expand

Is this relevant?

1989

1989

We present an almost-optimal parallel algorithm for finding triconnected components on a CRCW PRAM. The time complexity of our… Expand

Is this relevant?

Highly Cited

1985

Highly Cited

1985

We assume a parallel RAM model which allows both concurrent writes and concurrent reads of global memory. Our algorithms are… Expand

Is this relevant?