Nothing Special   »   [go: up one dir, main page]

skip to main content
Skip header Section
In search of clusters (2nd ed.)January 1998
Publisher:
  • Prentice-Hall, Inc.
  • Division of Simon and Schuster One Lake Street Upper Saddle River, NJ
  • United States
ISBN:978-0-13-899709-0
Published:01 January 1998
Pages:
578
Skip Bibliometrics Section
Reflects downloads up to 18 Feb 2025Bibliometrics
Abstract

No abstract available.

Cited By

  1. ACM
    Yasay J Web Server Utilization Using Common off-the-shelf Computers Proceedings of the 4th International Conference on Industrial and Business Engineering, (174-180)
  2. Khan A, Schioler H, Kulahci M and Knudsen T Big data analytics for industrial process control 2017 22nd IEEE International Conference on Emerging Technologies and Factory Automation (ETFA), (1-8)
  3. Dokeroglu T and Cosar A (2016). A novel multistart hyper-heuristic algorithm on the grid for the quadratic assignment problem, Engineering Applications of Artificial Intelligence, 52:C, (10-25), Online publication date: 1-Jun-2016.
  4. Khan S (2016). The Curious Case of Distributed Systems and Continuous Computing, IT Professional, 18:2, (4-7), Online publication date: 1-Mar-2016.
  5. ACM
    Lafitte J (2016). Entangled-Coupling, ACM SIGARCH Computer Architecture News, 42:5, (7-15), Online publication date: 9-Dec-2014.
  6. Hennessy J and Patterson D (2011). Computer Architecture, Fifth Edition, 10.5555/1999263, Online publication date: 29-Sep-2011.
  7. Pukdesree S, Lacharoj V and Sirisang P (2011). Performance evaluation of distributed database on PC cluster computers, WSEAS Transactions on Computers, 10:1, (21-30), Online publication date: 1-Jan-2011.
  8. Ferlin E, Lopes H, Lima C and Perretto M (2011). PRADA: a high-performance reconfigurable parallel architecture based on the dataflow model, International Journal of High Performance Systems Architecture, 3:1, (41-55), Online publication date: 1-Jan-2011.
  9. Breitbart J An approach for semiautomatic locality optimizations using OpenMP Proceedings of the 10th international conference on Applied Parallel and Scientific Computing - Volume 2, (291-301)
  10. Bozzon A, Brambilla M, Ceri S, Corcoglioniti F and Gatti N Chapter 14 Search Computing, (268-290)
  11. Buyya R, Yeo C, Venugopal S, Broberg J and Brandic I (2009). Cloud computing and emerging IT platforms, Future Generation Computer Systems, 25:6, (599-616), Online publication date: 1-Jun-2009.
  12. Dongarra J, Sterling T, Simon H and Strohmaier E (2009). High-Performance Computing, Computing in Science and Engineering, 7:2, (51-59), Online publication date: 1-Mar-2009.
  13. Zhao H, Ma Y, Huang X and Zhao F Performance Evaluation of Heartbeat-Style Failure Detector over Proactive and Reactive Routing Protocols for Mobile Ad Hoc Network Proceedings of the 11th Asia-Pacific Symposium on Network Operations and Management: Challenges for Next Generation Network Operations and Service Management, (370-379)
  14. Yang G, Zhou J and Liu G Implementation and performance evaluation of an adaptable failure detector in iSCSI Proceedings of the 7th international conference on Advanced parallel processing technologies, (251-260)
  15. Yang G, Zhou J and Liu G Implementation and Performance Evaluation of an Adaptable Failure Detector in iSCSI Advanced Parallel Processing Technologies, (251-260)
  16. Shin Yeo C and Buyya R (2007). Pricing for Utility-Driven Resource Management and Allocation in Clusters, International Journal of High Performance Computing Applications, 21:4, (405-418), Online publication date: 1-Nov-2007.
  17. Müller M, Juckeland G, Jurenz M and Kluge M Quality assurance for clusters Proceedings of the Third international conference on High Performance Computing and Communications, (44-52)
  18. ACM
    Hwu W, Ryoo S, Ueng S, Kelm J, Gelado I, Stone S, Kidd R, Baghsorkhi S, Mahesri A, Tsao S, Navarro N, Lumetta S, Frank M and Patel S Implicitly parallel programming models for thousand-core microprocessors Proceedings of the 44th annual Design Automation Conference, (754-759)
  19. Chou C, Chang H, Wang S, Huang K and Shen C An improved model for predicting HPL performance Proceedings of the 2nd international conference on Advances in grid and pervasive computing, (158-168)
  20. Yeo C and Buyya R (2006). A taxonomy of market-based resource management systems for utility-driven cluster computing, Software—Practice & Experience, 36:13, (1381-1419), Online publication date: 1-Nov-2006.
  21. Chang J, Kim Y and Kim Y Fault-Tolerant cluster management tool for self-managing of cluster DBMS Proceedings of the 10th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part I, (1067-1074)
  22. Chang J and Kim Y FTCM Proceedings of the Third international conference on Autonomic and Trusted Computing, (561-570)
  23. Lei Y, Junrui L, Chunyan M, Zeng X and Kang J FC-TRSN Proceedings of the 10th WSEAS international conference on Communications, (557-561)
  24. Efremides O and Ivanov G A dynamic workload balancing technique of a text matching algorithm on a cluster Proceedings of the 5th WSEAS international conference on Telecommunications and informatics, (287-292)
  25. Chou C, Chang H, Wang S and Tcheng S Modeling message-passing overhead on NCHC formosa PC cluster Proceedings of the First international conference on Advances in Grid and Pervasive Computing, (299-307)
  26. Efremides O and Ivanov G A fault-tolerant parallel text searching technique on a cluster of workstations Proceedings of the 5th WSEAS international conference on Applied computer science, (368-373)
  27. ACM
    Ong H, Vetter J, Studham R, McCurdy C, Walker B and Cox A (2006). Kernel-level single system image for petascale computing, ACM SIGOPS Operating Systems Review, 40:2, (50-54), Online publication date: 1-Apr-2006.
  28. Tang J and Zhang M An agent-based peer-to-peer grid computing architecture Proceedings of the 2006 Australasian workshops on Grid computing and e-research - Volume 54, (33-39)
  29. Kim C, Kim H, Kim M and Yoo J Design of system for multimedia streaming service Proceedings of the 2005 international conference on Embedded and Ubiquitous Computing, (867-878)
  30. Rubio J and John L (2005). Reducing Server Data Traffic Using a Hierarchical Computation Model, IEEE Transactions on Parallel and Distributed Systems, 16:10, (933-943), Online publication date: 1-Oct-2005.
  31. Dormido Canto S, de Madrid A and Bencomo S (2005). Parallel Dynamic Programming on Clusters of Workstations, IEEE Transactions on Parallel and Distributed Systems, 16:9, (785-798), Online publication date: 1-Sep-2005.
  32. Beltrán M, Bosque J and Guzmán A Initiating load balancing operations Proceedings of the 11th international Euro-Par conference on Parallel Processing, (292-301)
  33. Fraigniaud P, Mans B and Rosenberg A (2005). Efficient trigger-broadcasting in heterogeneous clusters, Journal of Parallel and Distributed Computing, 65:5, (628-642), Online publication date: 1-May-2005.
  34. Klonowska K, Lundberg L, Lennerstad H and Svahnberg C Extended Golomb Rulers as the New Recovery Schemes in Distributed Dependable Computing Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 16 - Volume 17
  35. Prins P (2004). Teaching parallel computing using Beowulf clusters, Journal of Computing Sciences in Colleges, 20:2, (55-61), Online publication date: 1-Dec-2004.
  36. Messer A, Bernadat P, Fu G, Chen D, Dimitrijevic Z, Lie D, Mannaru D, Riska A and Milojicic D (2004). Susceptibility of Commodity Systems and Software to Memory Soft Errors, IEEE Transactions on Computers, 53:12, (1557-1568), Online publication date: 1-Dec-2004.
  37. Choi E, Lim Y and Min D Performance comparison of various web cluster architectures Proceedings of the Third Asian simulation conference on Systems Modeling and Simulation: theory and applications, (617-624)
  38. ACM
    Petrou D, Ganger G and Gibson G Cluster scheduling for explicitly-speculative tasks Proceedings of the 18th annual international conference on Supercomputing, (336-345)
  39. ACM
    Juhász S and Charaf H Exploiting fast ethernet performance in multiplatform cluster environment Proceedings of the 2004 ACM symposium on Applied computing, (1407-1411)
  40. Crawford C, Dias D, Iyengar A, Novaes M and Zhang L Commercial applications of grid computing Performance analysis and grid computing, (211-229)
  41. ACM
    Olson R, Schmidt M, Gordon M and Rendell A Enabling the Efficient Use of SMP Clusters Proceedings of the 2003 ACM/IEEE conference on Supercomputing
  42. Gunawan T and Cai W (2003). Performance Analysis of a Myrinet-Based Cluster, Cluster Computing, 6:4, (299-313), Online publication date: 1-Oct-2003.
  43. Leff A, Rayfield J and Dias D (2003). Service-Level Agreements and Commercial Grids, IEEE Internet Computing, 7:4, (44-50), Online publication date: 1-Jul-2003.
  44. ACM
    Adler M, Gong Y and Rosenberg A Optimal sharing of bags of tasks in heterogeneous clusters Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures, (1-10)
  45. Kwok Y (2003). On Exploiting Heterogeneity for Cluster Based Parallel Multithreading Using Task Duplication, The Journal of Supercomputing, 25:1, (63-72), Online publication date: 1-May-2003.
  46. Kang O and Agrawal D (2003). Scalable scheduling for symmetric multiprocessors (SMP), Journal of Parallel and Distributed Computing, 63:3, (273-285), Online publication date: 1-Mar-2003.
  47. Dongarra J, Foster I, Fox G, Gropp W, Kennedy K, Torczon L and White A References Sourcebook of parallel computing, (729-789)
  48. Padua D and Hoeflinger J Supercomputers Encyclopedia of Computer Science, (1710-1718)
  49. Pfister G Cluster computing Encyclopedia of Computer Science, (218-221)
  50. Agbaria A and Friedman R (2002). Virtual-machine-based heterogeneous checkpointing, Software—Practice & Experience, 32:12, (1175-1192), Online publication date: 1-Oct-2002.
  51. Chow K and Kwok Y (2002). On Load Balancing for Distributed Multiagent Computing, IEEE Transactions on Parallel and Distributed Systems, 13:8, (787-801), Online publication date: 1-Aug-2002.
  52. Noronha R and Abu-Ghazaleh N Early cancellation Proceedings of the sixteenth workshop on Parallel and distributed simulation, (43-50)
  53. Montante R (2002). Beowulf and Linux, Journal of Computing Sciences in Colleges, 17:6, (10-18), Online publication date: 1-May-2002.
  54. Chen W, Toueg S and Aguilera M (2002). On the Quality of Service of Failure Detectors, IEEE Transactions on Computers, 51:5, (561-580), Online publication date: 1-May-2002.
  55. Jin M, Baker J and Meilander W The Power of SIMDs in Real-Time Scheduling Proceedings of the 16th International Parallel and Distributed Processing Symposium
  56. Kothari S, Cho J, Deng Y, Mitra S, Bian X, Leung R, Ghan S and Bourgeois A Software Tools and Parallel Computing for Numerical Weather Prediction Models Proceedings of the 16th International Parallel and Distributed Processing Symposium
  57. Sancho J, Flich J, Robles A, López P and Duato J Analyzing the Influence of Virtual Lanes on the Performance of InfiniBand Networks Proceedings of the 16th International Parallel and Distributed Processing Symposium
  58. Noronha R and Abu-Ghazaleh N Using Programmable NICs for Time-Warp Optimization Proceedings of the 16th International Parallel and Distributed Processing Symposium
  59. Weerasinghe G, Antonios I and Lipsky L A Generalized Analytic Performance Model of Distributed Systems that Perform N Tasks Using P Fault-Prone Processors Proceedings of the 16th International Parallel and Distributed Processing Symposium
  60. Goscinski A, Hobbs M and Silcock J (2002). GENESIS, Parallel Computing, 28:4, (557-606), Online publication date: 1-Apr-2002.
  61. Nair R (2002). Effect of increasing chip density on the evolution of computer architectures, IBM Journal of Research and Development, 46:2-3, (223-234), Online publication date: 1-Mar-2002.
  62. Rosenberg A (2002). Optimal Schedules for Cycle-Stealing in a Network of Workstations with a Bag-of-Tasks Workload, IEEE Transactions on Parallel and Distributed Systems, 13:2, (179-191), Online publication date: 1-Feb-2002.
  63. Chen W, Toueg S and Aguilera M (2002). On the Quality of Service of Failure Detectors, IEEE Transactions on Computers, 51:1, (13-32), Online publication date: 1-Jan-2002.
  64. De Palma P, Wiborg A and Withers A (2001). Super computing on a budget, Journal of Computing Sciences in Colleges, 17:2, (71-77), Online publication date: 1-Dec-2001.
  65. Collins D, George A and Quander R Achieving Scalable Cluster System Analysis and Management with a Gossip-Based Network Service Proceedings of the 26th Annual IEEE Conference on Local Computer Networks
  66. ACM
    Gupta I, Chandra T and Goldszmidt G On scalable and efficient distributed failure detectors Proceedings of the twentieth annual ACM symposium on Principles of distributed computing, (170-179)
  67. Kwok Y (2001). Fault-Tolerant Parallel Scheduling of Tasks on a Heterogeneous High-Performance Workstation Cluster, The Journal of Supercomputing, 19:3, (299-314), Online publication date: 1-Jul-2001.
  68. ACM
    Kim J, Kim K and Jung S Building a high-performance communication layer over virtual interface architecture on Linux clusters Proceedings of the 15th international conference on Supercomputing, (335-347)
  69. ACM
    Vaidyanathan K, Harper R, Hunter S and Trivedi K (2001). Analysis and implementation of software rejuvenation in cluster systems, ACM SIGMETRICS Performance Evaluation Review, 29:1, (62-71), Online publication date: 1-Jun-2001.
  70. ACM
    Vaidyanathan K, Harper R, Hunter S and Trivedi K Analysis and implementation of software rejuvenation in cluster systems Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems, (62-71)
  71. Pramanick I (2001). High Availability, International Journal of High Performance Computing Applications, 15:2, (169-174), Online publication date: 1-May-2001.
  72. Buyya R, Cortes T and Jin H (2001). Single System Image, International Journal of High Performance Computing Applications, 15:2, (124-135), Online publication date: 1-May-2001.
  73. Apon A and Baker M (2001). Network Technologies, International Journal of High Performance Computing Applications, 15:2, (102-114), Online publication date: 1-May-2001.
  74. Chen D, Messer A, Bernadat P, Fu G, Dimitrijevic Z, Lie D, Mannaru D, Riska A and Milojicic D JVM susceptibility to memory errors Proceedings of the 2001 Symposium on JavaTM Virtual Machine Research and Technology Symposium - Volume 1, (6-6)
  75. Castelli V, Harper R, Heidelberger P, Hunter S, Trivedi K, Vaidyanathan K and Zeggert W (2001). Proactive management of software aging, IBM Journal of Research and Development, 45:2, (311-332), Online publication date: 1-Mar-2001.
  76. Brock B, Carpenter G, Chiprout E, Dean M, De Backer P, Elnozahy E, Franke H, Giampapa M, Glasco D, Peterson J, Rajamony R, Ravindran R, Rawson F, Rockhold R and Rubio J (2001). Experience with building a commodity intel-based ccNUMA system, IBM Journal of Research and Development, 45:2, (207-227), Online publication date: 1-Mar-2001.
  77. Casado R, Bermúdez A, Quiles F, Sánchez J and Duato J (2001). A Protocol for Deadlock-Free Dynamic Reconfiguration in High-Speed Local Area Networks, IEEE Transactions on Parallel and Distributed Systems, 12:2, (115-132), Online publication date: 1-Feb-2001.
  78. ACM
    Milojicic D, Messer A, Shau J, Fu G and Munoz A Increasing relevance of memory hardware errors Proceedings of the 9th workshop on ACM SIGOPS European workshop: beyond the PC: new challenges for the operating system, (97-102)
  79. Aono F and Kimura M (2000). The AzusA 16-Way Itanium Server, IEEE Micro, 20:5, (54-60), Online publication date: 1-Sep-2000.
  80. Milojicic D, Hoyle S, Messer A, Munoz A, Russell L, Wylegala T, Vellanki V and Childs S Global memory management for a multi computer system Proceedings of the 4th conference on USENIX Windows Systems Symposium - Volume 4, (12-12)
  81. ACM
    Rosenberg A Optimal schedules for data-parallel cycle-stealing in networks of workstations (extended abstract) Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures, (22-29)
  82. ACM
    Rudra A and Gopalan R Adaptive use of a cluster of PCs for data warehousing applications Proceedings of the 2000 ACM symposium on Applied computing - Volume 2, (698-703)
  83. Gao L, Rosenberg A and Sitaraman R (1999). Optimal Clustering of Tree-Sweep Computations for High-Latency Parallel Environments, IEEE Transactions on Parallel and Distributed Systems, 10:8, (813-824), Online publication date: 1-Aug-1999.
  84. Burns M, George A and Wallace B (1999). Simulative performance analysis of gossip failure detection for scalable distributed systems, Cluster Computing, 2:3, (207-217), Online publication date: 1-Jul-1999.
  85. ACM
    Zhu H, Smith B and Yang T Scheduling optimization for resource-intensive Web requests on server clusters Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures, (13-22)
  86. Hwang K, Jin H, Chow E, Wang C and Xu Z (1999). Designing SSI Clusters with Hierarchical Checkpointing and Single I/O Space, IEEE Concurrency, 7:1, (60-69), Online publication date: 1-Jan-1999.
  87. Bhatt S, Chung F, Leighton F and Rosenberg A (1997). On Optimal Strategies for Cycle-Stealing in Networks of Workstations, IEEE Transactions on Computers, 46:5, (545-557), Online publication date: 1-May-1997.
  88. Bowen N, Antognini J, Regan R and Matsakis N (1997). Availability in parallel systems, IBM Systems Journal, 36:2, (284-300), Online publication date: 1-Apr-1997.
  89. Bowen N, Elko D, Isenberg J and Wang G (1997). A locking facility for parallel systems, IBM Systems Journal, 36:2, (202-220), Online publication date: 1-Apr-1997.
  90. Colajanni M and Cermele M (1997). DAME, IEEE Parallel & Distributed Technology: Systems & Technology, 5:1, (41-55), Online publication date: 1-Jan-1997.
Contributors
  • International Business Machines

Reviews

Jason Gait

A true cluster is built around a single system image, a cluster-wide realization of services that are necessary to make the cluster an application platform, such as a clock, a file system, high-performance intermachine communication, interprocessor synchronization, caching, work queues for load balancing, a unified name space for all resources, the ability to administer the cluster as though it were a single machine, and transaction logging. A true cluster is a bunch of sheep decked out so the flock looks and acts like a wolf, and thinks it is one. The author describes one way of realizing a single system image, as used by IBM, that designates a particular machine as an initial “floating master” responsible for maintaining the single system image, and fails over the master functionality to another machine in the cluster when necessary. It is hard to find cluster-ready applications. The only application I know of that is really cluster-friendly is database or transaction processing. The highly organized database partitions naturally, so it is easy to execute queries in parallel, with each machine in the cluster working on a piece of the database. It is as though clusters and databases were made for each other. With the current proliferation of symmetric multiprocessing (SMP) machines, together with the relative rarity of clusters, the proponents of clusters are becoming defensive. The author sets out to prove that there are reasons why the present favors clusters over SMPs and that the sooner we all recognize these reasons, the sooner clusters will drive SMPs to oblivion. The first reason advanced is that faster processors and relatively slower off-the-shelf memory lead to SMP architectures that do not scale across more than two processors. I do not buy this because any machine architect upgrading to faster processors is going to find a way to upgrade to faster memory at the same time: that is what the NUMA architecture is all about. The second reason is that high-speed interconnects have become common and cheap, making clusters easier to design and cheaper. I do not give this much weight either. Serious clusters have always sported high-speed interconnects whose cost was commensurate with the cost of the cluster. The cost of a cluster is only a small part of the cost of computing. The third reason is that tools for distributed computing have become ubiquitous, a positive development for clusters. One of the examples advanced by the author of a new tool for distributed computing is TCP, which has been around since the mid-1970s. Fourth, the market needs high availability to support rapidly growing markets in database warehousing and Web service. Here is where the cluster shines—high availability is the design center. The author makes a good case here. Businesses are recentralizing resources to regain control, the Internet is a 24-hour-a-day, seven-day-a-week window to the world, and service must be provided continuously. A critical aspect of cluster behavior is graceful failover when a machine leaves the cluster and equally graceful task redistribution when a machine is added to the cluster. The chapter on high availability via failover is the high point of the book. The tricky part about failover is dealing with false alarms, when the cluster thinks a machine is dead but it is not. After failover, there are two machines beating against one another to perform the same task, perhaps disastrously. One fix is to convert a potential false alarm to the real thing by disconnecting an apparently failed machine from the cluster. In contrast to a generally lively and authoritative, if long-winded, description of clusters, Pfister provides a simplistic and uninteresting overview of SMP and NUMA machines—he does not like them, and it shows. The book's flaw is bad editing. The author is exuberant and was allowed free rein for more than 500 pages. A good editor would have kept the book down to 200-odd pages, making it much better. In the end, the book is fun to read but is a weak technical contribution.

Access critical reviews of Computing literature here

Become a reviewer for Computing Reviews.

Please enable JavaScript to view thecomments powered by Disqus.

Recommendations