5 Matching Results

Search Results

Advanced search parameters have been applied.
in subjects: "Parallel Processing"  
Results: 1 - 5
open access

An {Omega}({radical}log log n) lower bound for routing in optical networks

Description: Optical communication is likely to significantly speed up parallel computation because the vast bandwidth of the optical medium can be divided to produce communication networks of very high degree. However, the problem of contention in high-degree networks makes the routing problem in these networks theoretically (and practically) difficult. In this paper we examine Valiant`s h-relation routing problem, which is a fundamental problem in the theory of parallel computing. The h-relation routing p… more
Date: November 6, 1993
Creator: Goldberg, L. A.; Jerrum, M. & MacKenzie, P. D.
Item Type: Refine your search to only Article
Partner: UNT Libraries Government Documents Department
open access

Salinas - An implicit finite element structural dynamics code developed for massively parallel platforms

Description: As computational needs for structural finite element analysis increase, a robust implicit structural dynamics code is needed which can handle millions of degrees of freedom in the model and produce results with quick turn around time. A parallel code is needed to avoid limitations of serial platforms. Salinas is an implicit structural dynamics code specifically designed for massively parallel platforms. It computes the structural response of very large complex structures and provides solutions … more
Date: April 6, 2000
Creator: BHARDWAJ, MANLJ K.; REESE,GARTH M.; DRIESSEN,BRIAN; ALVIN,KENNETH F. & DAY,DAVID M.
Item Type: Refine your search to only Article
Partner: UNT Libraries Government Documents Department
open access

Scheduling jobs that arrive over time

Description: A natural and basic problem in scheduling theory is to provide good average quality of service to a stream of jobs that arrive over time. In this paper we consider the problem of scheduling n jobs that are released over time in order to minimize the average completion time of the set of jobs. In contrast to the problem of minimizing average completion time when all jobs are available at time 0, all the problems that we consider are NP-hard, and essentially nothing was known about constructing g… more
Date: April 6, 1995
Creator: Phillips, C.; Stein, C. & Wein, J.
Item Type: Refine your search to only Article
Partner: UNT Libraries Government Documents Department
open access

Report on the Copper Mountain Conference on Multigrid Methods

Description: OAK B188 Report on the Copper Mountain Conference on Multigrid Methods. The Copper Mountain Conference on Multigrid Methods was held on April 11-16, 1999. Over 100 mathematicians from all over the world attended the meeting. The conference had two major themes: algebraic multigrid and parallel multigrid. During the five day meeting 69 talks on current research topics were presented as well as 3 tutorials. Talks with similar content were organized into sessions. Session topics included: Fluids; … more
Date: April 6, 2001
Item Type: Refine your search to only Article
Partner: UNT Libraries Government Documents Department
open access

Massively Parallel Computing: A Sandia Perspective

Description: The computing power available to scientists and engineers has increased dramatically in the past decade, due in part to progress in making massively parallel computing practical and available. The expectation for these machines has been great. The reality is that progress has been slower than expected. Nevertheless, massively parallel computing is beginning to realize its potential for enabling significant break-throughs in science and engineering. This paper provides a perspective on the state… more
Date: May 6, 1999
Creator: Dosanjh, Sudip S.; Greenberg, David S.; Hendrickson, Bruce; Heroux, Michael A.; Plimpton, Steve J.; Tomkins, James L. et al.
Item Type: Refine your search to only Article
Partner: UNT Libraries Government Documents Department
Back to Top of Screen