Keyword: Parallel Complexity : Search

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

Advanced Search

SEARCH GUIDE

Results: 1 - 2of2

Follow results:

per page:

Sort: Relevance

Context for search term 1Search term 1*

All Dates

LastSelect static range

Custom Range

Select starting monthSelect starting year

Select ending monthSelect ending year

Search name	Searched On	Run search
Keyword: Parallel Complexity (2)	30 Mar 2025	Run
Keyword: Dielectric Behavior (4)	30 Mar 2025	Run
Keyword: Degree Of Mixedness (1)	30 Mar 2025	Run
Keyword: Watermark Detection (2)	30 Mar 2025	Run
Keyword: Pantograph Equation (1)	30 Mar 2025	Run

articleNo Access
PERFORMANCE STUDY OF LU FACTORIZATION WITH LOW COMMUNICATION OVERHEAD ON MULTIPROCESSORS
- F. DESPREZ,
- J. J. DONGARRA, and
- B. TOURANCHEAU
Parallel Processing Letters01 Jun 1995
Preview Abstract
In this paper, we make efficient use of asynchronous communications on the LU decomposition algorithm with pivoting and a column-scattered data decomposition to derive precise computational complexities. We then compare these results with experiments on the Intel iPSC/860 and Paragon machines and show that very good performances can be obtained on a ring with asynchronous communications.
articleNo Access
The Parallel Complexity of Positive Linear Programming
- Luca Trevisan and
- Fatos Xhafa
Parallel Processing Letters01 Dec 1998
Preview Abstract
In this paper we study the parallel complexity of Positive Linear Programming (PLP), i.e. the special case of Linear Programming in packing/covering form where the input constraint matrix and constraint vector consist entirely of positive entries. We show that the problem of exactly solving PLP is P-complete.

1