Performance of Various Computers Using Standard Linear Equations SoftwareOctober 1989
- Author:
- Jack J. Dongarra
Skip Abstract Section
Abstract
This report compares the performance of different computer systems in solving dense systems of linear equations. The comparison involves approximately a hundred computers, ranging from a CRAY-MP to scientific workstations such as the Apollo and Sun to IBM PCs.
Cited By
- Haddadi S (2017). Benders decomposition for set covering problems, Journal of Combinatorial Optimization, 33:1, (60-80), Online publication date: 1-Jan-2017.
- Bouzid M, Aït Haddadene H and Salhi S (2017). An integration of Lagrangian split and VNS, Computers and Operations Research, 78:C, (513-525), Online publication date: 1-Feb-2017.
- Kemmo-Tchomt S, Lamy D and Tchernev N (2017). An effective multi-start multi-level evolutionary local search for the flexible job-shop problem, Engineering Applications of Artificial Intelligence, 62:C, (80-95), Online publication date: 1-Jun-2017.
- Wu W, Tian Y and Jin T (2016). A label based ant colony algorithm for heterogeneous vehicle routing with mixed backhaul, Applied Soft Computing, 47:C, (224-234), Online publication date: 1-Oct-2016.
- Lozano L, Duque D and Medaglia A (2016). An Exact Algorithm for the Elementary Shortest Path Problem with Resource Constraints, Transportation Science, 50:1, (348-357), Online publication date: 1-Feb-2016.
- Silva M, Subramanian A and Ochi L (2015). An iterated local search heuristic for the split delivery vehicle routing problem, Computers and Operations Research, 53:C, (234-249), Online publication date: 1-Jan-2015.
- Duque D, Lozano L and Medaglia A (2015). Solving the Orienteering Problem with Time Windows via the Pulse Framework, Computers and Operations Research, 54:C, (168-176), Online publication date: 1-Feb-2015.
- Matei O, Pop P, Sas J and Chira C (2015). An improved immigration memetic algorithm for solving the heterogeneous fixed fleet vehicle routing problem, Neurocomputing, 150:PA, (58-66), Online publication date: 20-Feb-2015.
- Chassaing M, Fontanel J, Lacomme P, Ren L, Tchernev N and Villechenon P (2014). A GRASP×ELS approach for the job-shop with a web service paradigm packaging, Expert Systems with Applications: An International Journal, 41:2, (544-562), Online publication date: 1-Feb-2014.
- Buson E, Roberti R and Toth P (2014). A Reduced-Cost Iterated Local Search Heuristic for the Fixed-Charge Transportation Problem, Operations Research, 62:5, (1095-1106), Online publication date: 1-Oct-2014.
- Nguyen P, Crainic T and Toulouse M (2014). A hybrid generational genetic algorithm for the periodic vehicle routing problem with time windows, Journal of Heuristics, 20:4, (383-416), Online publication date: 1-Aug-2014.
- Penna P, Subramanian A and Ochi L (2013). An Iterated Local Search heuristic for the Heterogeneous Fleet Vehicle Routing Problem, Journal of Heuristics, 19:2, (201-232), Online publication date: 1-Apr-2013.
- Lozano L and Medaglia A (2013). On an exact method for the constrained shortest path problem, Computers and Operations Research, 40:1, (378-384), Online publication date: 1-Jan-2013.
- Mavrotas G and Florios K (2013). An improved version of the augmented ε-constraint method (AUGMECON2) for finding the exact pareto set in multi-objective integer programming problems, Applied Mathematics and Computation, 219:18, (9652-9669), Online publication date: 1-May-2013.
- Simon T, Ward W and Boss A (2012). Performance analysis of Intel multiprocessors using astrophysics simulations, Concurrency and Computation: Practice & Experience, 24:2, (155-166), Online publication date: 1-Feb-2012.
- Domínguez J and Alba E A methodology for comparing the execution time of metaheuristics running on different hardware Proceedings of the 12th European conference on Evolutionary Computation in Combinatorial Optimization, (1-12)
- Lahimer A, Lopez P and Haouari M Climbing depth-bounded adjacent discrepancy search for solving hybrid flow shop scheduling problems with multiprocessor tasks Proceedings of the 8th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems, (117-130)
- Brandão J (2011). A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem, Computers and Operations Research, 38:1, (140-151), Online publication date: 1-Jan-2011.
- Wang J (2010). Discrete Hopfield network combined with estimation of distribution for unconstrained binary quadratic programming problem, Expert Systems with Applications: An International Journal, 37:8, (5758-5774), Online publication date: 1-Aug-2010.
- Çınar V, Öncan T and Süral H A genetic algorithm for the traveling salesman problem with pickup and delivery using depot removal and insertion moves Proceedings of the 2010 international conference on Applications of Evolutionary Computation - Volume Part II, (431-440)
- Yurtkuran A and Emel E (2010). A new Hybrid Electromagnetism-like Algorithm for capacitated vehicle routing problems, Expert Systems with Applications: An International Journal, 37:4, (3427-3433), Online publication date: 1-Apr-2010.
- Repoussis P, Tarantilis C, Bräysy O and Ioannou G (2010). A hybrid evolution strategy for the open vehicle routing problem, Computers and Operations Research, 37:3, (443-455), Online publication date: 1-Mar-2010.
- Normand J, Goldsztejn A, Christie M and Benhamou F (2010). A branch and bound algorithm for numerical Max-CSP, Constraints, 15:2, (213-237), Online publication date: 1-Apr-2010.
- Silberholz J and Golden B (2010). The effective application of a new approach to the generalized orienteering problem, Journal of Heuristics, 16:3, (393-415), Online publication date: 1-Jun-2010.
- Repoussis P, Tarantilis C and Ioannou G (2009). Arc-guided evolutionary algorithm for the vehicle routing problem with time windows, IEEE Transactions on Evolutionary Computation, 13:3, (624-647), Online publication date: 1-Jun-2009.
- Zhao F, Mei D, Sun J and Liu W A hybrid genetic algorithm for the vehicle routing problem with simultaneous pickup and delivery Proceedings of the 21st annual international conference on Chinese control and decision conference, (3964-3969)
- Wang J, Zhou Y, Yin J and Zhang Y (2009). Competitive Hopfield network combined with estimation of distribution for maximum diversity problems, IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, 39:4, (1048-1066), Online publication date: 1-Aug-2009.
- Luis M, Salhi S and Nagy G (2009). Region-rejection based heuristics for the capacitated multi-source Weber problem, Computers and Operations Research, 36:6, (2007-2017), Online publication date: 1-Jun-2009.
Manocha D, Calamia P, Lin M, Manocha D, Savioja L and Tsingos N Interactive sound rendering ACM SIGGRAPH 2009 Courses, (1-338)- Meignan D, Créput J and Koukam A A cooperative and self-adaptive metaheuristic for the facility location problem Proceedings of the 11th Annual conference on Genetic and evolutionary computation, (317-324)
- Zobolas G, Tarantilis C and Ioannou G (2009). Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm, Computers and Operations Research, 36:4, (1249-1267), Online publication date: 1-Apr-2009.
- Zhao F, Li S, Sun J and Mei D (2009). Genetic algorithm for the one-commodity pickup-and-delivery traveling salesman problem, Computers and Industrial Engineering, 56:4, (1642-1648), Online publication date: 1-May-2009.
- Créput J and Koukam A (2009). A memetic neural network for the Euclidean traveling salesman problem, Neurocomputing, 72:4-6, (1250-1264), Online publication date: 1-Jan-2009.
- Prins C (2009). Two memetic algorithms for heterogeneous fleet vehicle routing problems, Engineering Applications of Artificial Intelligence, 22:6, (916-928), Online publication date: 1-Sep-2009.
- Bartolini E and Mingozzi A (2009). Algorithms for the non-bifurcated network design problem, Journal of Heuristics, 15:3, (259-281), Online publication date: 1-Jun-2009.
- Boschetti M, Mingozzi A and Ricciardelli S (2008). A dual ascent procedure for the set partitioning problem, Discrete Optimization, 5:4, (735-747), Online publication date: 1-Nov-2008.
- Créput J and Koukam A (2008). The memetic self-organizing map approach to the vehicle routing problem, Soft Computing - A Fusion of Foundations, Methodologies and Applications, 12:11, (1125-1141), Online publication date: 1-Sep-2008.
- Drake J, Worley P and D’Azevedo E (2008). Algorithm 888, ACM Transactions on Mathematical Software, 35:3, (1-23), Online publication date: 1-Oct-2008.
- Loh K, Golden B and Wasil E (2008). Solving the one-dimensional bin packing problem with a weight annealing heuristic, Computers and Operations Research, 35:7, (2283-2291), Online publication date: 1-Jul-2008.
- Normand J, Goldsztejn A, Christie M and Benhamou F A Branch and Bound Algorithm for Numerical MAX-CSP Proceedings of the 14th international conference on Principles and Practice of Constraint Programming, (205-219)
- Mester D and Bräysy O (2007). Active-guided evolution strategies for large-scale capacitated vehicle routing problems, Computers and Operations Research, 34:10, (2964-2975), Online publication date: 1-Oct-2007.
- Li F, Golden B and Wasil E (2007). The open vehicle routing problem, Computers and Operations Research, 34:10, (2918-2930), Online publication date: 1-Oct-2007.
- Benkert K and Fischer R An Efficient Implementation of the Thomas-Algorithm for Block Penta-diagonal Systems on Vector Computers Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007, (144-151)
- Gao J, Gen M, Sun L and Zhao X (2007). A hybrid of genetic algorithm and bottleneck shifting for multiobjective flexible job shop scheduling problems, Computers and Industrial Engineering, 53:1, (149-162), Online publication date: 1-Aug-2007.
- Glencross M, Chalmers A, Lin M, Otaduy M and Gutierrez D Exploiting perception in high-fidelity virtual environments (Additional presentations from the 24th course are available on the citation page) ACM SIGGRAPH 2006 Courses, (1-es)
- Ho S and Gendreau M (2006). Path relinking for the vehicle routing problem, Journal of Heuristics, 12:1-2, (55-72), Online publication date: 1-Jan-2006.
- Scheuerer S (2006). A tabu search heuristic for the truck and trailer routing problem, Computers and Operations Research, 33:4, (894-909), Online publication date: 1-Apr-2006.
- Lan G and DePuy G (2006). On the effectiveness of incorporating randomness and memory into a multi-start metaheuristic with application to the Set Covering Problem, Computers and Industrial Engineering, 51:3, (362-374), Online publication date: 1-Nov-2006.
- Sur S, Chai L, Jin H and Panda D Shared receive queue based scalable MPI design for infiniband clusters Proceedings of the 20th international conference on Parallel and distributed processing, (101-101)
- Luchini P and Quadrio M (2006). A low-cost parallel implementation of direct numerical simulation of wall turbulence, Journal of Computational Physics, 211:2, (551-571), Online publication date: 20-Jan-2006.
- Sur S, Koop M and Panda D High-performance and scalable MPI over InfiniBand with reduced memory usage Proceedings of the 2006 ACM/IEEE conference on Supercomputing, (105-es)
- Sur S, Jin H, Chai L and Panda D RDMA read based rendezvous protocol for MPI over InfiniBand Proceedings of the eleventh ACM SIGPLAN symposium on Principles and practice of parallel programming, (32-39)
- Raghuvanshi N and Lin M Interactive sound synthesis for large scale environments Proceedings of the 2006 symposium on Interactive 3D graphics and games, (101-108)
- Paik S, Moon J, Kim S and Lee M (2006). Parallel performance of large scale impact simulations on Linux cluster super computer, Computers and Structures, 84:10-11, (732-741), Online publication date: 1-Apr-2006.
- Osman I (2006). A tabu search procedure based on a random Roulette diversification for the weighted maximal planar graph problem, Computers and Operations Research, 33:9, (2526-2546), Online publication date: 1-Sep-2006.
- Xie W and Sahinidis N A branch-and-reduce algorithm for the contact map overlap problem Proceedings of the 10th annual international conference on Research in Computational Molecular Biology, (516-529)
- Ghaziri H and Osman I (2006). Self-organizing feature maps for the vehicle routing problem with backhauls, Journal of Scheduling, 9:2, (97-114), Online publication date: 1-Apr-2006.
- Montemanni R and Gambardella L (2005). Exact algorithms for the minimum power symmetric connectivity problem in wireless networks, Computers and Operations Research, 32:11, (2891-2904), Online publication date: 1-Nov-2005.
- Jinquan Z, Lina N and Changjun J A Heuristic Scheduling Strategy for Independent Tasks on Grid Proceedings of the Eighth International Conference on High-Performance Computing in Asia-Pacific Region
- D'Amore L, Laccetti G and Lapegna M Block matrix multiplication in a distributed computing environment Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics, (625-632)
- Tinetti F and De Giusti A Broadcast-Based parallel LU factorization Proceedings of the 11th international Euro-Par conference on Parallel Processing, (867-876)
- Bräysy O and Gendreau M (2005). Vehicle Routing Problem with Time Windows, Part II, Transportation Science, 39:1, (119-139), Online publication date: 1-Feb-2005.
- Bräysy O and Gendreau M (2005). Vehicle Routing Problem with Time Windows, Part I, Transportation Science, 39:1, (104-118), Online publication date: 1-Feb-2005.
- Bessonov O, Fougère D and Roux B (2005). Development of efficient computational kernels and linear algebra routines for out-of-order superscalar processors, Future Generation Computer Systems, 21:5, (743-748), Online publication date: 1-May-2005.
- Caprara A and Monaci M (2004). On the two-dimensional Knapsack Problem, Operations Research Letters, 32:1, (5-14), Online publication date: 1-Jan-2004.
- Resende M and Werneck R (2004). A Hybrid Heuristic for the p-Median Problem, Journal of Heuristics, 10:1, (59-88), Online publication date: 1-Jan-2004.
- Sim L, Leedham G, Jian L and Schroder H (2003). Fast solution of large N × N matrix equations in an MIMD-SIMD hybrid system, Parallel Computing, 29:11-12, (1669-1684), Online publication date: 1-Nov-2003.
- Dongarra J, Foster I, Fox G, Gropp W, Kennedy K, Torczon L and White A References Sourcebook of parallel computing, (729-789)
- Ryoo H and Sahinidis N (2003). Global Optimization of Multiplicative Programs, Journal of Global Optimization, 26:4, (387-418), Online publication date: 1-Aug-2003.
- Gottlieb J, Marchiori E and Rossi C (2002). Evolutionary algorithms for the satisfiability problem, Evolutionary Computation, 10:1, (35-50), Online publication date: 1-Mar-2002.
- van der Steen A and Dongarra J Overview of high performance computers Handbook of massive data sets, (791-852)
- Worley P, Dunigan T, Fahey M, White J and Bland A Early evaluation of the IBM p690 Proceedings of the 2002 ACM/IEEE conference on Supercomputing, (1-21)
- Toth P and Vigo D (2002). Models, relaxations and exact approaches for the capacitated vehicle routing problem, Discrete Applied Mathematics, 123:1-3, (487-512), Online publication date: 15-Nov-2002.
- Tupper J Reliable two-dimensional graphing methods for mathematical formulae with two free variables Proceedings of the 28th annual conference on Computer graphics and interactive techniques, (77-86)
- Bull J, Smith L, Pottage L and Freeman R Benchmarking Java against C and Fortran for scientific applications Proceedings of the 2001 joint ACM-ISCOPE conference on Java Grande, (97-105)
- Hu Y, Jin G, Johnsson S, Kehagias D and Shalaby N (2000). HPFBench, ACM Transactions on Mathematical Software, 26:1, (99-149), Online publication date: 1-Mar-2000.
- (2000). Solving Graph Bisection Problems with Semidefinite Programming, INFORMS Journal on Computing, 12:3, (177-191), Online publication date: 1-Aug-2000.
- Imamura T (2000). An Estimation of Complexity and Computational Costs for Vertical Block-Cyclic Distributed Parallel LU Factorization, The Journal of Supercomputing, 15:1, (95-110), Online publication date: 1-Jan-2000.
- Jain A, Rangaswamy B and Meeran S (2000). New and “Stronger” Job-Shop Neighbourhoods, Journal of Heuristics, 6:4, (457-480), Online publication date: 1-Sep-2000.
- Pauletto G and Gilli M (2000). Parallel Krylov Methods for Econometric Model Simulation, Computational Economics, 16:1-2, (173-186), Online publication date: 1-Oct-2000.
- Krishnaswamy U and Scherson I (2000). A Framework for Computer Performance Evaluation Using Benchmark Sets, IEEE Transactions on Computers, 49:12, (1325-1338), Online publication date: 1-Dec-2000.
- Geoffray P, Prylli L and Tourancheau B BIP-SMP Proceedings of the 1999 ACM/IEEE conference on Supercomputing, (20-es)
- Bull J, Smith L, Westhead M, Henty D and Davey R A methodology for benchmarking Java Grande applications Proceedings of the ACM 1999 conference on Java Grande, (81-88)
- Warren M, Germann T, Lomdahl P, Beazley D and Salmon J Avalon Proceedings of the 1998 ACM/IEEE conference on Supercomputing, (1-11)
- Sears M, Stanley K and Henry G Application of a high performance parallel eigensolver to electronic structure calculations Proceedings of the 1998 ACM/IEEE conference on Supercomputing, (1-1)
- (1998). Solving the Orienteering Problem through Branch-and-Cut, INFORMS Journal on Computing, 10:2, (133-148), Online publication date: 1-May-1998.
- Charlesworth A (1998). Starfire, IEEE Micro, 18:1, (39-49), Online publication date: 1-Jan-1998.
- Shectman J and Sahinidis N (1998). A Finite Algorithm for Global Minimization ofSeparable Concave Programs, Journal of Global Optimization, 12:1, (1-36), Online publication date: 1-Jan-1998.
- von Eicken T, Culler D, Goldstein S and Schauser K Active messages 25 years of the international symposia on Computer architecture (selected papers), (430-440)
- Espasa R, Valero M and Smith J Vector architectures Proceedings of the 12th international conference on Supercomputing, (425-432)
- Dekker E (1998). Architecture Scalability of Parallel Vector Computers with a Shared Memory, IEEE Transactions on Computers, 47:5, (614-624), Online publication date: 1-May-1998.
- Abei Y, Itakura K, Boku T, Nakamura H and Nakazawa K Performance Improvement for Matrix Calculation on CP-PACS Node Processor Proceedings of the High-Performance Computing on the Information Superhighway, HPC-Asia '97
- Boku T, IwasakiI Y, Nakamura H and Nakazawa K The Architecture of Massively Parallel Processor CP-PACS Proceedings of the 2nd AIZU International Symposium on Parallel Algorithms / Architecture Synthesis
- (1997). An Exact Algorithm for the Vehicle Routing Problem with Backhauls, Transportation Science, 31:4, (372-385), Online publication date: 1-Nov-1997.
- Greer B and Henry G High performance software on Intel Pentium Pro processors or Micro-Ops to TeraFLOPS Proceedings of the 1997 ACM/IEEE conference on Supercomputing, (1-13)
- Boku T, Itakura K, Nakamura H and Nakazawa K CP-PACS Proceedings of the 11th international conference on Supercomputing, (108-115)
- Leblanc L, Park J, Sridhar V and Kalvenes J (1996). Topology design and bridge-capacity assignment for interconnecting token ring LANs, Telecommunications Systems, 6:1, (21-43), Online publication date: 1-Dec-1996.
- Mattson T, Scott D and Wheat S A TeraFLOP Supercomputer in 1996 Proceedings of the 10th International Parallel Processing Symposium, (84-93)
- Mohr J (1996). Upsizing, Downsizing, Rightsizing, Wrongsizing, IEEE Computational Science & Engineering, 3:2, (99-102), Online publication date: 1-Jun-1996.
- (1996). Job Shop Scheduling by Local Search, INFORMS Journal on Computing, 8:3, (302-317), Online publication date: 1-Aug-1996.
- Krishnaswamy U and Scherson I (1996). Micro-architecture evaluation using performance vectors, ACM SIGMETRICS Performance Evaluation Review, 24:1, (148-159), Online publication date: 15-May-1996.
- Krishnaswamy U and Scherson I Micro-architecture evaluation using performance vectors Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems, (148-159)
- Dongarra J (1993). Linear Algebra Libraries for High-Performance Computers, IEEE Parallel & Distributed Technology: Systems & Technology, 1:1, (17-24), Online publication date: 1-Feb-1993.
- White S, Hester P, Kemp J and McWilliams G (1993). How Does Processor MHz Relate to End-User Performance? Part 2, IEEE Micro, 13:5, (79-89), Online publication date: 1-Sep-1993.
- Hillis W and Tucker L (1993). The CM-5 Connection Machine, Communications of the ACM, 36:11, (31-40), Online publication date: 1-Nov-1993.
- Thearling K and Smith S An improved supercomputer sorting benchmark Proceedings of the 1992 ACM/IEEE conference on Supercomputing, (14-19)
- Shimizu T, Horie T and Ishihata H (1992). Low-latency message communication support for the AP1000, ACM SIGARCH Computer Architecture News, 20:2, (288-297), Online publication date: 1-May-1992.
- von Eicken T, Culler D, Goldstein S and Schauser K (1992). Active messages, ACM SIGARCH Computer Architecture News, 20:2, (256-266), Online publication date: 1-May-1992.
- Shimizu T, Horie T and Ishihata H Low-latency message communication support for the AP1000 Proceedings of the 19th annual international symposium on Computer architecture, (288-297)
- von Eicken T, Culler D, Goldstein S and Schauser K Active messages Proceedings of the 19th annual international symposium on Computer architecture, (256-266)
- Bell G (1992). Ultracomputers: a teraflop before its time, Communications of the ACM, 35:8, (26-47), Online publication date: 1-Aug-1992.
- Bailey D, Barszcz E, Barton J, Browning D, Carter R, Dagum L, Fatoohi R, Frederickson P, Lasinski T, Schreiber R, Simon H, Venkatakrishnan V and Weeratunga S The NAS parallel benchmarks—summary and preliminary results Proceedings of the 1991 ACM/IEEE conference on Supercomputing, (158-165)
- Bradley D, Cybenko G, Larson J, Ahmad F, Golab J and Straka M Supercomputer workload decomposition and analysis Proceedings of the 5th international conference on Supercomputing, (458-467)
- Berry M, Cybenko G and Larson J (1991). Paper, Parallel Computing, 17:10-11, (1173-1194), Online publication date: 1-Dec-1991.
- Karp A and Flatt H (1990). Measuring parallel processor performance, Communications of the ACM, 33:5, (539-543), Online publication date: 1-May-1990.
Recommendations
Performance of various computers using standard linear equations software
This report compares the performance of different computer systems in solving dense systems of linear equations. The comparison involves approximately a hundred computers, ranging from a CRAY Y-MP to scientific workstations such as the Apollo and Sun to ...
Performance of various computers using standard linear equations software
This report compares the performance of different computer systems in solving dense systems of linear equations. The comparison involves approximately a hundred computers, ranging from a CRAY Y-MP to scientific workstations such as the Apollo and Sun to ...
Performance of various computers using standard linear equations software in a Fortran environment
In this note we compare a number of different computer systems for solving dense systems of linear equations using the LINPACK software in a Fortran environment. There are about 50 computers compared, ranging from a Cray X-MP to the 68000 based systems ...