Cluster Computing: Proceedings of the IEEE International Conference on Cluster Computing (3rd: 2001: Newport Beach, CA)

• Record Nr.: UNINA9910872892703321
• Autore: Katz Daniel S
• Pubbl/distr/stampa: [Place of publication not identified], : IEEE Computer Society Press, 2001
• Descrizione fisica: 1 online resource
• Disciplina: 004
• Soggetti: Computer science
• Lingua di pubblicazione: Inglese
• Formato: Materiale a stampa
• Livello bibliografico: Monografia
• Note generali: Bibliographic Level Mode of Issuance: Monograph
• Nota di contenuto: 2001 IEEE International Conference On Cluster Computing [front matter] -- Early experiences with the myricom 2000 switch on an SMP Beowulf-class cluster for unstructured adaptive meshing -- Using multirail networks in high-performance clusters -- Next generation parallel virtual file system -- Experiences with Oasis+: a fault tolerant storage system -- Clusterfile: a flexible physical layout parallel file system -- High performance computing with microsoft windows 2000 -- Gulfstream - a system for dynamic topology management in multi-domain server farms -- Cluster rolling upgrade using multiple version support -- Dense computing with Transmeta's Crusoe.
• Sommario/riassunto: MultiProtocol Label Switching (MPLS) is a routing model proposed by the IETF for the Internet, and is becoming widely popular. In this paper, we initiate a theoretical study of the routing model, and give routing algorithms and lower bounds in a variety of situations. We first study the routing problems on the line. We then build up our results from paths through trees to more general graphs. The basic technique to go to general graphs is that of finding a tree cover, which is a small set of subtrees of the graph such that for each pair of vertices, one of the trees contains a shortest (or near-shortest) path between them. The concept of tree covers appears to have many interesting applications.