Vectorization and multitasking of nonlinear network programming algorithms (Q1116904): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Distributed Asynchronous Relaxation Methods for Convex Network Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Generalized Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concurrent stochastic methods for global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: OR Practice—Large-Scale Nonlinear Network Models and Their Application / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unrolling loops in fortran / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039997 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Large Scale Generalized Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplicial Decomposition for Convex Generalized Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear Network Programming on Vector Supercomputers: A Study on the CRAY X-MP / rank
 
Normal rank
Property / cites work
 
Property / cites work: A distributed algorithm for convex network optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Numerical Optimization: Current Status and an Annotated Bibliography / rank
 
Normal rank

Latest revision as of 14:18, 19 June 2024

scientific article
Language Label Description Also known as
English
Vectorization and multitasking of nonlinear network programming algorithms
scientific article

    Statements

    Vectorization and multitasking of nonlinear network programming algorithms (English)
    0 references
    0 references
    0 references
    0 references
    1988
    0 references
    Vector supercomputers are designed with two levels of parallelism in order to achieve computational efficiency: low level parallelism through vector operations and high level pallelism with multiple independent processors. These innovations have a significant impact on the development of algorithms for network optimization. In this paper a framework for the vectorization and multitasking of optimization software is developed. It is then applied on the primal truncated Newton algorithm for nonlinear generalized network problems. The vectorization and multitasking of the algorithm is discussed and illustrated with computational experiments with the software system NLPNETG on the CRAY series of vector multiprocessors.
    0 references
    0 references
    0 references
    0 references
    0 references
    Vector supercomputers
    0 references
    two levels of parallelism
    0 references
    vector operations
    0 references
    multiple independent processors
    0 references
    network optimization
    0 references
    primal truncated Newton algorithm
    0 references
    nonlinear generalized network problems
    0 references