Search Results

Advanced search parameters have been applied.
open access

PICO: An Object-Oriented Framework for Branch and Bound

Description: This report describes the design of PICO, a C++ framework for implementing general parallel branch-and-bound algorithms. The PICO framework provides a mechanism for the efficient implementation of a wide range of branch-and-bound methods on an equally wide range of parallel computing platforms. We first discuss the basic architecture of PICO, including the application class hierarchy and the package's serial and parallel layers. We next describe the design of the serial layer, and its central n… more
Date: December 1, 2000
Creator: Eckstein, Jonathan; Hart, William E. & Phillips, Cynthia A.
Partner: UNT Libraries Government Documents Department
open access

Strengthening Integrality Gaps for Capacitated Network Design and Covering Problems

Description: A capacitated covering IP is an integer program of the form min{l_brace}ex{vert_bar}Ux {ge} d, 0 {le} x {le} b, x {element_of} Z{sup +}{r_brace}, where all entries of c, U, and d are nonnegative. Given such a formulation, the ratio between the optimal integer solution and the optimal solution to the linear program relaxation can be as bad as {parallel}d{parallel}{sub {proportional_to}}, even when U consists of a single row. They show that by adding additional inequalities, this ratio can be imp… more
Date: July 28, 1999
Creator: Carr, Robert D.; Fleischer, Lisa K.; Leung, Vitus J. & Phillips, Cynthia A.
Partner: UNT Libraries Government Documents Department
open access

Processor Allocation on Cplant: Achieving General Processor Locality Using One-Dimensional Allocation Strategies

Description: The Computational Plant, or Cplant is a commodity-based supercomputer under development at Sandia National Laboratories. This paper describes resource-allocation strategies to achieve processor locality for parallel jobs in Cplant and other supercomputers. Users of Cplant and other Sandia supercomputers submit parallel jobs to a job queue. When a job is scheduled to run, it is assigned to a set of processors. To obtain maximum throughput, jobs should be allocated to localized clusters of proces… more
Date: July 1, 2002
Creator: Leung, Vitus J.; Arkin, Esther M.; Bender, Michael A.; Bunde, David P.; Johnston, Jeanette R.; Lal, Alok et al.
Partner: UNT Libraries Government Documents Department
Back to Top of Screen