Home     Top: Architecture: Clusters    [Clusters   Distributed Architecture   Parallel]

Change ordering:   Authority   Hubs (tutorials)   Date   Expected authority       Show titles only
Ordered by the number of citations

This directory is created automatically and some papers may be mislabeled. Only document within the CiteSeer database are listed. The directory is intended to provide entry points for browsing the database and is not intended to be authoritative. Papers may not appear in all relevant categories. For example, papers in a sub-category may not appear in higher level categories.

88   JavaParty - Transparent Remote Objects in Java - Philippsen, Zenger (1997)   (Correct)
Java's threads offer appropriate means either for parallel programming of SMPs or as target constructs when compiling add-on features (e.g. forall constructs, automatic parallelization, etc.) Unfortun... / any significant support for cluster computing or workstation-based

86   Dynamically Forecasting Network Performance Using the Network Weather .. - Wolski (1998)   (Correct)
this paper, we outline its design and detail the predictive performance of the forecasts it generates. While the forecasting methods are general, we focus on their ability to predict the TCP/IP end-to... / TR-CS - to appear in Cluster Computing Networks Software Tools

78   An Architecture for a Secure Service Discovery Service - Czerwinski, Zhao, Hodes, Joseph, Katz (1999)   (Correct)
The widespread deployment of inexpensive communications technology, computational resources in the networking infrastructure, and network-enabled end devices poses an interesting problem for end users... / indirection along with cluster computing environments appeared

47   Legion: The Next Logical Step Toward a Nationwide Virtual Computer - Grimshaw, Wulf, French, Weaver.. (1994)   (Correct)
The coming of giga-bit networks makes possible the realization of a single nationwide virtual computer comprised of a variety of geographically distributed high-performance machines and workstations. ... /

32   A Message Passing Standard for MPP and Workstations - Dongarra, Otto, Snir, Walker (1996)   (Correct)
this article discusses some of MPI's more interesting features, including point-to-point communication, userdefined datatypes, collective communications, and groups, contexts, and communicators. unkno... / for LAM a Unix cluster computing environment. Available by

31   Partitioning and Ordering Large Radiosity Computations - Teller, Fowler, Funkhouser, Hanrahan (1994)   (Correct)
We describe a system that computes radiosity solutions for polygonal environments much larger than can be stored in main memory. The solution is stored in and retrieved from a database as the computat... / The problem of efficiently computing cluster-cluster interactions is not

31   Low-Latency Communication over Fast Ethernet - Welsh, Basu, von Eicken (1996)   (Correct)
Fast Ethernet (100Base-TX) can provide a low-cost alternative to more esoteric network technologies for high-performance cluster computing. We use a network architecture based on the U-Net approach to... / for high-performance cluster computing. We use a network

27   A Parallel Bottom-up Clustering Algorithm with Applications to.. - Cong, Smith (1993)   (Correct)
In this paper, we present a bottom-up clustering algorithm based on recursive collapsing of small cliques in a graph. The sizes of the small cliques are derived using random graph theory. This cluster... / for large circuits since computing cluster separation requires O n

26   A Parallel Workload Model and Its Implications for Processor.. - Allen Downey (1996)   (Correct)
We develop a workload model based on the observed behavior of parallel computers at the San Diego Supercomputer Center and the Cornell Theory Center. This model gives us insight into the performance o... /

22   SIMPLE: A Methodology for Programming High Performance Algorithms on.. - Bader, JaJa (1997)   (Correct)
We describe a methodology for developing high performance programs running on clusters of SMP nodes. Our methodology is based on a small kernel (SIMPLE ) of collective communication primitives that ma... / an ATM switch. Keywords Cluster Computing Symmetric Multiprocessors

22   SIMPLE: A Methodology for Programming High Performance Algorithms on.. - Bader, JaJa (1997)   (Correct)
We describe a methodology for developing high performance programs running on clusters of SMP nodes. The SMP cluster programming methodology is based on a small prototype kernel (SIMPLE) of collective... /

20   Scalable Networked Information Processing Environment (SNIPE) - Fagg, Moore, Dongarra, Geist (1997)   (Correct)
SNIPE is a metacomputing system that aims to provide a reliable, secure, fault-tolerant environment for long-term distributed computing applications and data stores across the global InterNet. This sy... / available with typical cluster computing and or distributed computer

20   The MOSIX Multicomputer Operating System for High Performance Cluster .. - Barak (1998)   (Correct)
The scalable computing cluster at Hebrew University consists of 64 Pentium and PentiumPro servers that are connected by fast Ethernet and the Myrinet LANs. It is running the MOSIX operating system, an... / System for High Performance Cluster Computing Amnon Barak and Oren br applications. Keywords Cluster computing load-balancing preemptive

18   Cluster Computing Review - Baker, Fox, Yau (1995)   (Correct)
this report reviews the current state-of-the-art. Cluster computing is a rapidly maturing technology that seems certain to play an important part in the `network-centric' computing future. Tony Hey Th... / Cluster Computing Review Mark Baker br at Syracuse University. Cluster Computing Review Mark A. Baker

18   Load Balancing for Multi-Projector Rendering Systems - Samanta, Zheng, Funkhouser, Li, Singh (1999)   (Correct)
Multi-projector systems are increasingly being used to provide large-scale and high-resolution displays for next-generation interactive 3D graphics applications, including large-scale data visualizati... / Immersive display systems cluster computing parallel rendering load br channels. The challenge of cluster computing is to develop low-overhead

17   A Resource Query Interface for Network-Aware Applications - Lowekamp, Miller, Sutherland, Gross, .. (1999)   (Correct)
Development of portable network-aware applications demands an interface to the network that allows an application to obtain information about its execution environment. This paper motivates and descri... /

17   Predicting the CPU Availability of Time-shared Unix Systems - Wolski, Spring, Hayes (1998)   (Correct)
this paper, we focus on the problem of making short and medium term forecasts of CPU availability on time-shared Unix systems. We evaluate the accuracy with which availability can be measured using Un... / the network weather service. Cluster Computing . also available from

17   Predicting the CPU Availability of Time-shared Unix Systems on the.. - Wolski, Spring, Hayes (1998)   (Correct)
In this paper we focus on the problem of making short and medium term forecasts of CPU availability on timeshared Unix systems. We evaluate the accuracy with which availability can be measured using U... / network weather service. Cluster Computing . also available from

16   An Efficient Implementation of Java's Remote Method Invocation - Maassen, van Nieuwpoort, Veldema.. (1999)   (Correct)
Java offers interesting opportunities for parallel computing. In particular, Java Remote Method Invocation provides an unusually flexible kind of Remote Procedure Call. Unlike RPC, RMI supports polymo... / of other languages for cluster computing were found to be quite

15   ATM and Fast Ethernet Network Interfaces for User-level Communication - Welsh, Basu, von Eicken (1997)   (Correct)
Fast Ethernet and ATM are two attractive network technologies for interconnecting workstation clusters for parallel and distributed computing. This paper compares network interfaces with and without p... / high bandwidths required for cluster computing can be achieved even with br low-latency communication for cluster computing is indeed possible using

14   A Review of Commercial and Research Cluster Management Software - Baker (1995)   (Correct)
this report reviews the current state-of-the-art. Cluster computing is a rapidly maturing technology that seems certain to play an important part in the `network-centric' computing future. Tony Hey Th... / June Version . Cluster Computing Review -Oct- br Whilst it is clear that cluster computers' have limitations many

13   High-Performance Cluster Computing Using SCI - Ibel, Schauser, Scheiman, Weis (1997)   (Correct)
The Scalable Coherent Interface (SCI) is a recent communication standard for cluster interconnects. We study the use of SCI in a high-performance parallel computing setting, using a cluster of UltraSp... / DRAFT High-Performance Cluster Computing Using SCI Maximilian br for high-performance cluster computing. Introduction

13   PUNCH: An architecture for Web-enabled wide-area network-computing - Kapadia, Fortes (1999)   (Correct)
This paper addresses the architectural issues that arise in the design of a universally accessible wide-area network-computing unknown Cluster Computing 2 (1999) 153--164 153 PUNCH: An architecture fo... / Cluster Computing -

13   Transparent Result Caching - Vahdat, Anderson (1998)   (Correct)
The goal of this work is to develop a general framework for transparently managing the interactions and dependencies among input files, development tools, and output files. By unobtrusively monitoring... /

12   COMPaS: A Pentium Pro PC-based SMP Cluster and its Experience - Tanaka, Matsuda, Ando, Kubota, Sato (1998)   (Correct)
We have built an eight node SMP cluster called COMPaS (Cluster Of Multi-Processor Systems), each node of which is a quadprocessor Pentium Pro PC. We have designed and implemented a remote memory bas... / are many research efforts in cluster computing. The Illinois High

12   Empirical Analysis of Overheads in Cluster Environments - Schmidt, Sunderam (1995)   (Correct)
In concurrent computing environments based on heterogeneous processing elements interconnected by general-purpose networks, several classes of overheads contribute to lowered performance. The most obv... / . Introduction Cluster computing or concurrent processing on br tools. For these reasons cluster computing is expected to receive

12   A Fault Detection Service for Wide Area Distributed Computations - Stelling, Foster, Kesselman, Lee.. (1998)   (Correct)
The potential for faults in distributed computing systems is a significant complicating factor for application developers. While a variety of techniques exist for detecting and correcting faults, the ... /

11   Efficient Collective Operations with ATM Network Interface Support - Huang (1996)   (Correct)
In this paper, we propose a novel approach to implementing collective communication operations across ATM-interconnected workstation clusters. Under this methodology, performance-critical components, ... / bandwidth that have made such cluster computing feasible however have br be found in The study of cluster computing across ATM networks is

10   Multicasting Protocols for High-Speed, Wormhole-Routing Local Area.. - Gerla (1996)   (Correct)
Wormhole routing LANs are emerging as an effective solution for high bandwidth, low latency interconnects in distributed computing and cluster computing applications. An important example is the 640 M... / in distributed computing and cluster computing applications. An important br Distributed supercomputing and cluster computing impose certain critical

10   Prediction and Adaptation in Active Harmony - Hollingsworth, Keleher (1998)   (Correct)
This paper focuses on the problem of developing metrics to measure changing computational needs and the techniques to react to them. Section 2 describes the overall architecture of the Harmony System.... /

9   Design Choices in the SHRIMP System: An Empirical Study - Blumrich, Alpert, Chen, Clark.. (1998)   (Correct)
The SHRIMP cluster-computing system has progressed to a point of relative maturity; a variety of applications are running on a 16-node system. We have enough experience to understand what we did right... / Abstract The SHRIMP cluster-computing system has progressed to a

9   Harnessing User-Level Networking Architectures for Distributed Object .. - Madukkarumukumana, Shah (1998)   (Correct)
In a distributed object system such as Distributed Component Object Model (DCOM) [5, 7], legacy transport protocols used for communication limit the performance over high-speed networks. By making use... /

9   A Secure Communications Infrastructure for High-Performance.. - Foster, Karonis, Kesselman, Koenig.. (1996)   (Correct)
We describe a software infrastructure designed to support the development of applications that use high-speed networks to connect geographically distributed supercomputers, databases, and scientific i... /

8   PVFS: A Parallel File System for Linux Clusters - Carns, Ligon, III, Ross, Thakur   (Correct)
As Linux clusters have matured as platforms for low-cost, high-performance parallel computing, software packages to provide many key services have emerged, especially in areas such as message passing ... / ethernet. Introduction Cluster computing has recently emerged as a br have been developed to meet cluster computing's needs. In particular

8   BIP-SMP: High Performance Message Passing over a Cluster of Commodity .. - Geoffray, Prylli, Tourancheau (1999)   (Correct)
Device Interface Channel Interface NX Check_incoming "short", "eager", P4 TCP/IP Paragon SP/2 Generic ADI code, datatype mgmt, heterogeneity request queues mgmt " Protocol interface" SGI... / capacity and is essential in cluster computing. Usually old communication

7   Massive Parallelism with Workstation Clusters - Challenge or Nonsense? - Cap (1993)   (Correct)
Workstation cluster computing recently has become an important and successful technique. The communication bottleneck limits this approach to small and medium sized configurations of up to 30 workstat... / Abstract Workstation cluster computing recently has become an br algorithms massively parallel cluster computing using thousands of

7   An Opportunity Cost Approach For Job Assignment In A Scalable.. - Amir, Awerbuch, Barak, Borgstrom..   (Correct)
A new method is presented for job assignment to and reassignment between machines in a computing cluster. Our method is based on a theoretical framework that has been experimentally tested and show... / System for High Performance Cluster Computing Journal of Future br Job Assignment In A Scalable Computing Cluster Yair Amir

7   Group Communication Support for Distributed Collaboration Systems - Injong Rhee (1998)   (Correct)
The Collaborative Computing Transport Layer (CCTL) is a communication substrate consisting of a suite of multiparty protocols, providing varying service qualities among process groups. CCTL explicitly... /

7   A PCI-SCI Bridge for Building a PC Cluster with Distributed Shared.. - Acher, Hellwagner, Karl, Leberecht (1996)   (Correct)
In 1995, the SMiLE (Shared Memory in a LAN-like Environment) project at LRR-TUM started to set up a SCIbased PC cluster with distributed shared memory (DSM). This system will serve as a platform for e... / distributed and parallel cluster computing can be achieved with SCI

7   Operating System Services for Wide-Area Applications - Vahdat (1998)   (Correct)
Operating System Services for Wide-Area Applications by Mohammad Amin Vahdat Doctor of Philosophy in Computer Science University of California, Berkeley Professor Thomas E. Anderson, Cochair Pro... / . . Cluster Computing . br operating systems and cluster computing. Earlier chapters contain

7   ICEBERG: An Internet-core Network Architecture for Integrated.. - Wang, Raman, Chuah, Biswas, Gummadi, .. (2000)   (Correct)
In the ICEBERG project at U. C. Berkeley, we are developing an Internet-based integration of telephony and data services spanning diverse access networks. Our primary goals are extensibility, scalabil... / tolerance customization cluster computing platform signaling br of ICEBERG-capable Ninja cluster computing platforms which act as

7   Dynamic Function Placement for Data-intensive Cluster Computing - Amiri, al. (2000)   (Correct)
Optimally partitioning application and filesystem functionality within a cluster of clients and servers is a difficult problem due to dynamic variations in application behavior, resource availability,... / Placement for Data-intensive Cluster Computing Khalil Amiri David br related to code mobility and cluster computing-far too large to fully

7   Javelin: Parallel Computing on the Internet - Neary, Christiansen, Cappello.. (1999)   (Correct)
Java offers the basic infrastructure needed to integrate computers connected to the Internet into a seamless distributed computational resource: an infrastructure for running coarse-grained parallel ... / -traditionally a cluster computing application fitting the

7   The Supercomputer Supernet Testbed: A WDM Based Supercomputer.. - Kleinrock, Gerla, Bambos, Cong.. (1996)   (Correct)
Current fiber optic networks effectively provide local connectivity among end user computing devices, and can serve as backbone fabric between LAN subnets across campus and metropolitan areas. However... / speed network that supports cluster computing. This must be done in order

7   Parallel Rendering - Crockett (1995)   (Correct)
In computer graphics, rendering is the process by which an abstract description of a scene is converted to an image. When the scene is complex, or when high-quality images or high frame rates are requ... /

7   The Vesta Parallel File System - Corbett, Feitelson (2001)   (Correct)
The Vesta parallel file system is designed to provide parallel file access to application programs running on multicomputers with parallel I/O subsystems. Vesta uses a new abstraction of files: a file... /

6   Forwarding Group Multicast Protocol (FGMP) for Multihop, Mobile.. - Chiang, al. (1998)   (Correct)
In this paper we propose a new multicast protocol for multihop mobile wireless networks. Instead of forming multicast trees, a group of nodes in charge of forwarding multicast packets is designated ac... / To Appear At Cluster Computing Forwarding Group

6   Improving Goodput by Co-scheduling CPU and Network Capacity - Basney, Livny (1999)   (Correct)
In a cluster computing environment, executable, checkpoint, and data files must be transferred between application submission and execution sites. As the memory footprint of cluster applications incre... / Abstract In a cluster computing environment executable br providing high throughput cluster computing in environments with limited

6   Structural Prediction Models for High-Performance Distributed.. - Schopf (1997)   (Correct)
We present a structural performance model that uses application profiles and component models to predict an application's performance on a set of distributed resources. We decompose application perfor... /

6   Optimizing Parallel Applications for Wide-Area Clusters - Bal, Plaat, Bakker, Dozy, Hofman (1998)   (Correct)
Recent developments in networking technology cause a growing interest in connecting local-area clusters of workstations over wide-area links, creating multilevel clusters. Often, latency and bandwidth... / assumed. Keywords Cluster Computing Meta Computing Wide-area br testbed we use consists of four cluster computers located at different

6   Implementing an API for Distributed Adaptive Computing Systems - Jones, Scharf, Scott, Twaddle.. (1999)   (Correct)
This paper presents the pertinent aspects of the API and the design philosophy, along with implementation details. Adaptive computing architectures and applications are discussed in Section 2. The str... / and Applications The cluster computing paradigm is a cost-effective

6   Collision Avoidance and Resolution Multiple Access (CARMA) - Garces, Garcia-Luna-Aceves (1997)   (Correct)
This paper shows that using tree-splitting algorithms to resolve the collision of RTSs in a FAMA protocol running in a highspeed network improves substantially the performance of FAMA protocols under ... / Cluster Computing Collision

6   JESSICA: Java-Enabled Single-System-Image Computing Architecture - Ma, Wang, Lau (1999)   (Correct)
JESSICA stands for \Java-Enabled Single-System-Image Computing Architecture", a middleware that runs on top of the standard UNIX operating system to support parallel execution of multi-threaded Java... / tested. Keywords cluster computing single-system-image br JESSICA Introduction Cluster computing has been a subject for

6   QoS and Contention-Aware Multi-Resource Reservation - Xu, Nahrstedt, Viswanathan.. (2000)   (Correct)
We present a QoS and contention-aware multi-resource reservation algorithm to provide end-to-end QoS guarantees for distributed and component-based services. We study a reservation-enabled environment... /

5   Campus-Wide Computing: Early Result Using Legion at the University of .. - Grimshaw (1995)   (Correct)
The Legion project at the University of Virginia is an attempt to provide system services that provide the illusion of a single virtual machine to users, a virtual machine that provides both improved... / that must be addressed in cluster computing is management. The

5   A Cost-Benefit Framework for Online Management of a Metacomputing.. - Amir, Awerbuch, Sean   (Correct)
Managing a large collection of networked machines, with a series of incoming jobs, requires that the jobs be assigned to machines wisely. A new approach to this problem is presented, inspired by econo... / System for High Performance Cluster Computing Journal of Future br reallocation in a scalable computing cluster. We have developed these

5   The Hector Distributed Run-Time Environment - Russ, Robinson, Flachs, Heckel (1998)   (Correct)
Harnessing the computational capabilities of a network of workstations promises to off--load work from overloaded supercomputers onto largely idle resources overnight. Several capabilities are needed ... / Research Center C. Cluster Computing Systems Systems that can br example one good review of cluster computing systems con- ducted in

5   A Comparison of Three High Speed Networks for Parallel Cluster.. - Bal, Hofman, Verstoep (1997)   (Correct)
Many high speed networks have been developed that may be suitable for parallel computing on clusters of workstations. This paper compares three different networks: FastEthernet, ATM, and Myrinet. We... / Speed Networks for Parallel Cluster Computing Henri Bal Rutger br best performance for parallel cluster computing. Several experiments in

5   Supporting Parallel Applications on Clusters of Workstations: The.. - Rosu, Schwan, Fujimoto (1998)   (Correct)
This paper presents a novel networking architecture designed for communication intensive parallel applications running on clusters of workstations (COWs) connected by high speed networks. The architec... / Journals To appear in Cluster Computing Vol. . Supporting br Approach to High Performance Cluster Computing. The reduction of software

5   miniBSP: A BSP Language and Transformation System - Skillicorn (1996)   (Correct)
We define a small BSP-based language, that is simpler and more flexible than standard BSP. Its composition rules allow supersteps to be composed sequentially and in parallel, so it is a subsetsynchron... / program transformation cluster computing dataflow. Introduction

5   Efficient Remote Method Invocation - Veldema, van Nieuwpoort, Maassen.. (1998)   (Correct)
In current Java implementations, Remote Method Invocation is slow. On a Pentium Pro/Myrinet cluster, for example, a null RMI takes 1228 µs using Sun's JDK 1.1.4. This paper describes Manta, a Java sys... / for high performance cluster computing. On modern workstation br of other languages for cluster computing were found to be quite

5   Supporting Parallel Applications on Clusters of Workstations: The.. - Rosu, Schwan, Fujimoto (1997)   (Correct)
This paper presents a novel networking architecture designed for communication intensive parallel applications running on clusters of workstations (COWs) connected by high speed networks. This archite... /

5   Optimal Multicast with Packetization and Network Interface Support - Ram Kesavan (1997)   (Correct)
Modern networks typically limit the size of the largest packet for efficient communication. Thus, long messages are packetized and transmitted. Such networks also provide network interface support f... / host node. requirements of cluster computing can be achieved. The

5   Parallel Computing on Wide-Area Clusters: the Albatross Project - Bal, Plaat, Kielmann, Maassen, van.. (1999)   (Correct)
The aim of the Albatross project is to study applications and programming environments for widearea cluster computers, which consist of multiple clusters connected by wide-area networks. Parallel proc... / environments for widearea cluster computers which consist of multiple br system. Introduction As cluster computers become more widely

5   A Hyperbolic Model for Communication in Layered Parallel Processing.. - Stoica, Sultan, KEYES (1996)   (Correct)
We introduce a model for communication costs in parallel processing environments, called the hyperbolic model, which generalizes two-parameter dedicated-link models in an analytically simple way. The ... / modeling parallel processing cluster computing workstation networks br . The individual nodes in cluster computing environments are powerful

5   Hybrid Sort-First and Sort-Last Parallel Rendering with a Cluster of.. - Samanta, Funkhouser, Li, Singh (2000)   (Correct)
We investigate a new hybrid of sort-first and sort-last approach for parallel polygon rendering, using as a target platform a cluster of PCs. Unlike previous methods that statically partition the 3D m... / Keywords Parallel rendering cluster computing. Introduction The

5   Universal Inbox: Providing Extensible Personal Mobility and Service.. - Raman, Katz, Joseph (2000)   (Correct)
Communication technology has been seeing rapid growth, characterized by new access networks (e.g., cellular, pager, wireless-IP) and end-devices (e.g., PDAs, twoway pagers, multi-model access devices)... / can be scaled well using cluster computing platforms . Provide

4   Pupa: A Low-Latency Communication System for Fast Ethernet - Verma, al. (1998)   (Correct)
Pupa is a low-latency communication system that provides the same quality of message delivery as TCP but is designed specifically for a parallel computing cluster connected by a 100 Mbits/sec Fast Eth... / specifically for a parallel computing cluster connected by a Mbits sec

4   Managing Security in High-Performance Distributed Computations - Foster, Karonis, Kesselman, Tuecke (1998)   (Correct)
We describe a software infrastructure designed to support the development of applications that use high-speed networks to connect geographically distributed supercomputers, databases, and scientific i... /

4   Scalable Cluster Computing with MOSIX for LINUX - Barak, La'adan, Shiloh (1999)   (Correct)
Mosix is a software tool for supporting cluster computing. It consists of kernel-level, adaptive resource sharing algorithms that are geared for high performance, overhead-free scalability and ease-of... / Scalable Cluster Computing with MOSIX for LINUX br software tool for supporting cluster computing. It consists of

4   Memory Ushering in a Scalable Computing Cluster - Barak (1997)   (Correct)
Scalable Computing Clusters (SCC) are becoming an alternative to mainfraims and MPP's for the execution of high performance, demanding applications in multi-user, time-sharing environments. In order t... / Memory Ushering in a Scalable Computing Cluster Amnon Barak and Avner br Abstract Scalable Computing Clusters SCC are becoming an

4   Scheduling a Metacomputer With Uncooperative Sub-schedulers - Gehring, Preiß (1999)   (Correct)
The main advantage of a metacomputer is not its peak performance but better utilization of its machines. Therefore, e#cient scheduling strategies are vitally important to any metacomputing project. A ... / of this category. Cluster Computing has developed very fast br Some of the best known cluster computing environments are

4   Conductor: Distributed Adaptation for Complex Networks - Yarvis, Wang, Rudenko, Reiher, Popek (1999)   (Correct)
Computer networks are becoming more complex and diverse. Increasingly, an end-to-end connection will traverse several links with orders of magnitude differences in characteristics such as bandwid... / Fox This system uses cluster computing technology to provide a

4   Asynchronous Parallel Pattern Search for Nonlinear Optimization - Hough, Kolda, al. (2000)   (Correct)
Parallel pattern search (PPS) can be quite useful for engineering optimization problems characterized by a small number of variables (say 10-50) and by expensive objective function evaluations such as... / distributed computing cluster computing. Email br fault tolerance distributed computing cluster computing. Email

4   A Monitoring Sensor Management System for Grid Environments - Tierney, Crowley, Gunter, Holding.. (2000)   (Correct)
Large distributed systems such as Computational Grids require a large amount of monitoring data be collected for a variety of tasks such as fault detection, performance analysis, performance tuning... / across Supernet to a Linux compute cluster which did the data br ISI East Arlington VA Compute Cluster DARPA Supernet OC-

4   Nimrod/G: An Architecture for a Resource Management and Scheduling.. - Buyya, Abramson, Giddy (2000)   (Correct)
The availability of powerful microprocessors and high-speed networks as commodity components has enabled high performance computing on distributed systems (wide-area cluster computing). In this enviro... / systems wide-area cluster computing In this environment as br resource popularly called cluster computing Clusters appear in

4   Design and Deployment of a Passive Monitoring Infrastructure - Fraleigh, Diot, Lyles, Owezarski.. (2001)   (Correct)
This paper presents the architecture of a passive monitoring system installed within the Sprint IP backbone network. This system di ers from other packet monitoring systems in that it collects packet-... / IPMON systems. A node computing cluster used for data analysis. The

4   Cactus Tools for Grid Applications - Allen, Benger, Dramlitsch, Goodale.. (2001)   (Correct)
ch as those already developed for Cactus, will open the door to global computing resources for scientic users. Keywords: 1. Introduction Cactus [1], [2] is an open source problem solving environm... / Cluster Computing Cactus br single MPP supercomputer cluster or compute farm tightly coupled

4   Active Names: Programmable Location and Transport of Wide-Area.. - Vahdat, Anderson, Dahlin (1999)   (Correct)
Active Names are a general framework for the development and composition of wide-area applications. The key insight behind Active Names is the need to introduce programmability of name binding to supp... /

4   Active Naming: Programmable Location and Transport of Wide-Area.. - Vahdat, Anderson, Dahlin (1998)   (Correct)
Active Names are a general framework for the development and composition of wide-area applications. The key insight behind Active Names is the need to introduce programmability of name binding to supp... /

4   Automatic Configuration and Run-time Adaptation of Distributed.. - Chang (1999)   (Correct)
Increased platform heterogeneity and varying resource availability in distributed systems motivates the design of resource-aware applications, which ensure a desired performance level by continuously ... /

3   SCI-PVM: Parallel Distributed Computing on SCI Workstation Clusters - Zoraja, al. (1999)   (Correct)
Workstation and PC clusters interconnected by SCI (Scalable Coherent Interface) are very promising technologies for high performance cluster computing. Using commercial SBus to SCI interface cards and... / for high performance cluster computing. Using commercial SBus to br enhance the viability of cluster computing. Introduction Cluster

3   Adaptive Load Balancing of Distributed SPMD Computations: A.. - Cermele Colajanni (1997)   (Correct)
Efficient parallel computing on distributed platforms still presents many obstacles. This paper addresses the important issue of masking the power heterogeneity and variability of non-dedicated nodes.... / scenarios. Index Terms Cluster computing Dynamic load balancing

3   Computing Performance Bounds for Fork-Join Queueing Models - John Lui (1994)   (Correct)
We study a computer system which accepts parallel programs which can be modeled using the fork-join computational paradigm. The system under study has K homogeneous servers, each having an infinite ca... / for a parallel workstation cluster computing environment. Conclusions

3   Scheduling Independent Tasks on Metacomputing Systems - James, Hawick (1999)   (Correct)
Metacomputing is a convenient and powerful abstraction for dealing with the complexities that arise when managing and using a large collection of heterogeneous computational resources. One of the most... / metacomputing scheduling cluster computing adaptive scheduling. br the problems of scheduling on cluster computing. There is already a large

3   Switcherland: A QoS Communication Architecture for Workstation.. - Eberle, Oertli (1998)   (Correct)
Computer systems have become powerful enough to process continuous data streams such as video or animated graphics. While processing power and communication bandwidth of today's systems typically are ... / Switcherland is optimized for cluster computing in that i it serves as a br architecture for cluster computing. Unlike LAN technologies it

3   Challenging Applications on Fast Networks - Langendoen, Hofman, Bal (1998)   (Correct)
Parallel computing on clusters of workstations is attractive because of the low costs in comparison to MPPs, but the speed of the local area network limits the class of applications that can be run ef... / because of their impact on cluster computing and because they are used br nodes in the Pentium Pro cluster and computing the average time. All

3   Dynamic Function Placement in Active Storage Clusters - Amiri, Petrou, Ganager, Gibson (1999)   (Correct)
Optimally partitioning application and filesystem functionality within a cluster of clients and servers is a difficult problem due to dynamic variations in application behavior, resource availability ... / related to code mobility and cluster computing -far too large to fully

3   Comparing the Communication Performance and Scalability of a Linux.. - Luecke, Raffin, Coyle (1999)   (Correct)
This paper presents scalability and communication performance results for a cluster of PCs running Linux with the GM communication library, a cluster of PCs running Windows NT with the HPVM communicat... / IEEE International Workshop on Cluster Computing Australia IWCC'

3   A Dynamic Load Balancing System for Parallel Cluster Computing - Overeinder, Sloot, Heederik (1996)   (Correct)
In this paper we discuss a new approach to dynamic load balancing of parallel jobs in clusters of workstations and describe the implementation into a Unix run-time environment. The efficiency of the p... / Balancing System for Parallel Cluster Computing B. J. Overeinder P. M. A. br lowers the barrier to cluster computing. This pilot study indicates

3   Comparing the Communication Performance and Scalability of a Linux.. - Luecke, Raffin, Coyle (2000)   (Correct)
This paper presents scalability and communication performance results for a cluster of PCs running Linux with the GM communication library, a cluster of PCs running Windows NT with the HPVM communic... / International Workshop on Cluster Computing pp - December -

3   Computing on a Cluster of PCs: Project Overview and Early Experiences - Paas, al. (1997)   (Correct)
This paper summarizes some projects that deal with parallel computing on clusters of PCs. Although quite different approaches have been chosen, they have in common that they aim at shared data paral... / work. In distinction to other cluster computing projects we are mostly br The SCI-related part of the cluster computing effort aims at shared data

3   The ParPar System: A Software MPP - Dror Feitelson Anat (1999)   (Correct)
Introduction To place ParPar 1 . in context, we must first review the different modes of operation common on clusters. Probably the most common approach is to view the cluster as a Network Of Works... / speed networks for parallel cluster computing In Communication and

3   Using Embedded Network Processors to Implement Global Memory.. - Yvonne Coady Joon (1999)   (Correct)
Advances in network technology continue to improve the communication performance of workstation and PC clusters, making high-performance workstation-cluster computing increasingly viable. These hardwa... / high-performance workstation-cluster computing increasingly viable. These br the goal of high-performance cluster computing. There are two main

3   Workstation Cluster Computation from the Perspective of the User - Cap (1994)   (Correct)
The use of workstation clusters for solving demanding application problems has widely been adopted. This paper analyses structural aspects which influence the performance of algorithms on such "hype... / Workstation Cluster Computation from the Perspective of br organizational aspects of cluster computing. The paper concludes with a

3   Cluster Computing White Paper - Baker (2000)   (Correct)
This paper considers the issues, requirements, and methodologies for achieving single system image at multiple levels of abstractions necessary for ease of management and programming. Following that i... / Cluster Computing White Paper Status - br Tools for Scalable Parallel Cluster Computing Jack Dongarra University

3   QoS-Aware Discovery of Wide-Area Distributed Services - Xu, Nahrstedt, Wichadakul (2001)   (Correct)
The global computational grids bring together distributed computation/communication resources. Beyond this, we envision the emergence of global `service grids', which provide a `market' of application... / International Symposium on Cluster Computing and the Grid CCGrid

3   Optimizing Execution of Component-based Applications using Group.. - Beynon, Kurc, Sussman, Saltz (2001)   (Correct)
Recent research on programming models for developing applications in the Grid has proposed component-based models as a viable approach, in which an application is composed of multiple interacting comp... /

3   Parallel Rendering with K-Way Replication - Samanta, Funkhouser, Li (2001)   (Correct)
With the recent advances in commodity graphics hardware performance, PC clusters have become an attractive alternative to traditional high-end graphics workstations. The main challenge is to develop p... / interactive visualization cluster computing computer graphics systems.

3   Grid Data Management Pilot (GDMP): A Tool for Wide Area Replication - Samar, Stockinger (2001)   (Correct)
The CMS experiment at CERN, the European Organization for Nuclear Research, is currently setting up a Data Grid which will provide access to several Terabytes of data, distributed and replicated. In t... / been speaking about meta and cluster computing the trend has turned to

3   Tracing a large-scale Peer to Peer System: an hour in the life of.. - Markatos (2001)   (Correct)
Peer-to-peer computing and networking, a new model of communication and computation, has recently started to gain significant acceptance. This model not only enables clients to take a more active role... / International Symposium on Cluster Computing and the Grid

3   Data Allocation Strategies for Dense Linear Algebra Kernels on.. - Boudet, Petitet, Rastello, Robert (1999)   (Correct)
We study the implementation of dense linear algebra computations, such as matrix multiplication and linear system solvers, on two-dimensional (2D) grids of heterogeneous processors. For these operatio... / and Toni Cortes editors Cluster Computing Technologies Environments br in distributed networks. Cluster Computing - .

3   IRM: Integrated Region Matching for Image Retrieval - Li, Wang, Wiederhold (2000)   (Correct)
Content-based image retrieval using region segmentation has been an active research area. We present IRM (Integrated Region Matching), a novel similarity measure for regionbased image similarity compa... /

2   EDPEPPS: An Environment for the Design and Performance Evaluation of.. - Delaitre, Justo, Spies, Winter (1996)   (Correct)
This paper describes the architecture of a development environment for computer-aided parallel software engineering. The environment comprises tools for program design, simulation, and visualisation. ... / rapid growth of parallel cluster computing has signalled the urgent

2   JMPF: A Message Passing Framework for Cluster Computing in Java - Rajkumar, Nagamani (1998)   (Correct)
As we enter 21 st century, our dependency on the parallel or distributed computing to solve large scientific problems is going to increase each day. This observation has inspired many researchers to... / Message Passing Framework for Cluster Computing in Java RAJKUMAR School br Passing Framework for Cluster Computing in Java is one

2   A Competitive Analysis of Load Balancing Strategies for Parallel Ray.. - Heirich, al. (1998)   (Correct)
This paper examines the effectiveness of load balancing strategies for ray tracing on large parallel computersystems and cluster computers. Popular static load balancing strategies are shown to be i... / parallel computersystems and cluster computers. Popular static load br The advent of commodity based cluster computing has made it possible to

2   Extensible Resource Management For Cluster Computing - Nayeem Islam (1996)   (Correct)
Advanced general-purpose parallel systems should be able to support diverse applications with different resource requirements without compromising effectiveness and efficiency. We present a new resour... / Resource Management For Cluster Computing Nayeem Islam br resource management model for cluster computing that allows multiple

2   Market-Based Massively Parallel Internet Computing - Cappello, Christiansen, Neary.. (1997)   (Correct)
Recent advances in Internet connectivity and implementations of safer distributed computing through languages such as Java provide the foundation for transforming computing resources into tradable com... / Introduction Internet-based cluster computing involving thousands of

2   Multicast Scheduling Algorithms in Mobile Networks - Nagy, Singh (1997)   (Correct)
We examine ways in which data can be efficiently multicasted to mobile users in a cellular network infrastructure. Using a theoretical approach, a mathematical description of the model is given and a ... /

2   High-Performance Cluster Computing Using Scalable Coherent Interface - Ibel, Schauser, Scheiman, Weis (1997)   (Correct)
In this paper we discuss our experience with highperformance cluster computing using Scalable Coherent Interface (SCI), an IEEE communication standard. We present detailed measurements of basic SCI tr... / High-Performance Cluster Computing Using Scalable Coherent br with highperformance cluster computing using Scalable Coherent

2   Gardens: An Integrated Programming Language and System for Parallel.. - Roe, Szyperski (1998)   (Correct)
Gardens is an integrated programming language and system supporting parallel computation across networks of workstations. It addresses a combination of goals: it (i) maximises performance and (ii) i... / computing and in many cases cluster computing assume a fixed number of

2   Cheating the I/O Bottleneck: Network Storage with Trapeze/Myrinet - Anderson, al. (1998)   (Correct)
Recent advances in I/O bus structures (e.g., PCI), highspeed networks, and fast, cheap disks have significantly expanded the I/O capacity of desktop-class systems. This paper describes a messaging sys... / boost the potential of cluster computing switched cluster

2   Bobnet: high-performance message passing for commodity networking.. - Csanady, al. (1998)   (Correct)
Bobnet is a low-latency message-passing protocol designed for use as the high performance networking software in a loosely coupled cluster of computers. It features zero-copy sends directly from user-... / commodity ethernet cluster computing. Introduction As br we provide an overview of cluster computing technological developments

2   Harvest, Yield, and Scalable Tolerant Systems - Fox, Brewer (1999)   (Correct)
The cost of reconciling consistency and state management with high availability is highly magnified by the unprecedented scale and robustness requirements of today's Internet applications. We propose ... / developed in the context of cluster computing where it is well accepted

2   Developing and Evaluating Abstractions for Distributed Supercomputing - Keahey, Gannon (1998)   (Correct)
ions for Distributed Supercomputing Katarzyna Keahey Dennis Gannon Department of Computer Science Indiana University 215 Lindley Hall Bloomington, IN 47405 E-mail: keahey@cs.indiana.edu To fully reali... / Cluster Computing Developing

2   Breaking the Curse of Dynamics by Task Migration: Pilot Experiments.. - Overeinder, Sloot (1997)   (Correct)
With the advent of high speed networks, distributed cluster computing and metacomputing have assumed an enormous interest. However, software methods and techniques to make the full potential of these ... / speed networks distributed cluster computing and metacomputing have br in high performance cluster computing and metacomputing are

2   PIOUS: An Architecture for Parallel I/O in Distributed Computing.. - Moyer, Sunderam (1993)   (Correct)
PIOUS is a parallel file system architecture for providing process groups access to permanent storage within a heterogeneous network computing environment. PIOUS employs data declustering to exploit t... / Presented at the Workshop on Cluster Computing Florida State University br of the Workshop on Cluster Computing Tallahassee FL December

2   Cluster Computing: The Wave of the Future? - Geist (1994)   (Correct)
Using clusters of workstations is becoming a very popular method to solve both large and small scientific problems. One of the driving forces behind this shift is the availability of portable robust s... / Cluster Computing The Wave of the Future br the driving forces behind cluster computing and the limitations imposed

2   PARNASS: Porting Gigabit-LAN components to a workstation cluster - Griebel, Zumbusch (1997)   (Correct)
this memory is very limited. There is support for scatter and gather operations. Furthermore there are no operating system (OS) calls involved during communication, which could slow down the protocol.... /

2   Approaches to Support Parallel Programming on Workstation Clusters: A .. - Freisleben, Kielmann (1995)   (Correct)
The goal of this report is to survey state of the art and existing approaches for parallel programming on workstation clusters with special emphasis on object--oriented programming. First, workstation... / concepts relevant to cluster computing. In section existing tools br on top of LAM an MPI cluster computing environment but the

2   Parallel Application Software on High Performance Computers. Survey.. - Allan (1999)   (Correct)
A software environment of unprecidented quality and functionality is emerging in which coupled computing resources are accessed via client-server and Web-based tools. This is driven by a combination o... / of workstations NOWs cluster computing. c fl Council for the br Buyya ed.High Performance Cluster Computing Architecures and Systems

2   On the Design and Semantics of User-Space Communication Subsystems - Warschko, Blum, Tichy (1999)   (Correct)
The problem with Gbit/s networks is to get the hardware performance into the applications. The most promising technique is a zero-copy protocol combined with a user-space communication subsystem that ... / HighPerformance Cluster Computing. Introduction Modern

2   Problem Decomposition for Non-Uniformity and Processor Heterogeneity - Phyllis Crandall Michael (1995)   (Correct)
Grid problems that exhibit non-uniformity or irregularity are common in science and engineering. Methods for partitioning these problems across traditional parallel machines with homogeneous processor... / system but even more so in cluster computing. As previously mentioned

2   A Signaling System Using Lightweight Call Sessions - Wang, Joseph, Katz (2000)   (Correct)
Because of the emergence of heterogeneous access devices and diverse wired and wireless networks, and a substantial lack of support for integrating these networks, we are building a communication netw... / This leads us to employ a cluster computing platform to carry out most br describes in detail the cluster computing platform and each of the

2   Madeleine: An Efficient and Portable Communication Interface for.. - Bouge, Méhaut, Namyst (1999)   (Correct)
We introduce Madeleine, a communication interface specifically designed to support distributed, multithreaded applications in both a portable and e cient way. Thanks to its new API, Madeleine can impl... / High-performance computing Cluster computing Multithreading br and M. Weis. High-performance cluster computing using Scalable Coherent

2   Data Management for Large-Scale Scientific Computations in High.. - Choudhary, Kandemir, No, Memik.. (1999)   (Correct)
data set space. (f) Contention on disks. example, use the names like BC001, BC002,..., BC365 as data set names, where BC001 is the data set for the first day of the year and so on. In cases such as th... / Cluster Computing Data

2   HARNESS: Heterogeneous Adaptable Reconfigurable NEtworked SystemS - Dongarra, al.   (Correct)
This paper describes our vision, goals and plans for HARNESS, a distributed, reconfigurable and heterogeneous computing environment that supports dynamically adaptable parallel applications. HARNESS... / of the present network and cluster computing model to include multiple br with each other. Today's cluster computing frameworks typically involve

2   Direct Queries for Discovering Network Resource Properties in a.. - Lowekamp, O'Hallaron, Gross (2000)   (Correct)
this paper will discuss our results with using SNMP to obtain network information. Section 2 describes several techniques for performance prediction, including benchmark- and network-based ap- 2 B. Lo... / Cluster Computing to appear - br in distributed networks. Cluster Computing - May .

2   Dynamic Service Discovery for Mobile Computing: Intelligent Agents.. - Chen, Joshi, Finin (2000)   (Correct)
The emergence of ad-hoc pervasive connectivity for devices based on Bluetooth-like systems provides a new way to create applications for mobile systems. We propose to realize ubiquitous computing sy... /

2   The Harness Metacomputing Framework - Migliardi, Sunderam (1999)   (Correct)
Metacomputing frameworks have received renewed attention of late, fueled both by advances in hardware and networking, and by novel concepts such as computational grids. However these frameworks are o... / First distributed and cluster computing technologies change often in

2   Implementation and Performance of a Parallel File System for High.. - Ligon, Ross (1996)   (Correct)
Dedicated Cluster Parallel Computers (DCPCs) are emerging as low-cost high performance environments for many important applications in science and engineering. A significant class of applications that... / are demonstrating that cluster computing can address a wider range

2   ScaLAPACK: A Portable Linear Algebra Library For Distributed Memory.. - Blackford, Choi, Cleary, Demmel.. (1996)   (Correct)
Contents of ScaLAPACK # HPF Interface to ScaLAPACK # Issues of Heterogeneous Computing # Performance # Future Directions # Conclusions http:##www.netlib.org#scalapack#index.html, November 1996 2 ScaLA... / intended to be used in cluster computing contexts. Di culties arise

2   SilkRoad: A Multithreaded Runtime System with Software Distributed.. - Peng, Wong, Feng, Yuen (2000)   (Correct)
Multithreaded parallel system with software Distributed Shared Memory (DSM) is an attractive direction in cluster computing. In these systems, distributing workloads and keeping the shared memory oper... / is an attractive direction in cluster computing. In these systems br programs. Keywords cluster computing multithreading lazy

2   Multiple Bypass: Interposition Agents for Distributed Computing - Thain, Livny (2001)   (Correct)
Interposition agents are a well known device for attaching legacy applications to distributed system.s However, agents are difficult to build and are often large, monolithic pieces of software which a... /

2   Efficacy of Floor Control Protocols in Distributed Multimedia.. - Dommel, Garcia-Luna-Aceves (1999)   (Correct)
this paper. We define the floor as a generic short-lived synchronization primitive for multimedia objects. Several factors contribute to the complexity of deploying floor control for CMA: the system c... / Cluster Computing Efficacy

2   Adapting to Load on Workstation Clusters - Robert Brunner Theoretical   (Correct)
Desktop workstations represent a largely untapped source of computational power for parallel computing. Two of the main problems in utilizing these workstations are developing strategies for migrating... / fraction of the time in a day cluster computing o ers the possibility of

2   Design and Evaluation of Smart Disk Architecture for DSS Commercial.. - Memik, Kandemir, Choudhary (2000)   (Correct)
power of large-scale applications are increasing rapidly. Clusters seem to be the most attractive architecture for such applications, due to their low costs and high scalability. On the other hand, sm... /

2   Group Communication in Differentiated Services Networks - Bless, Wehrle (2001)   (Correct)
The Differentiated Services (DiffServ) approach will also bring benefits for multicast applications which need quality of service support. For instance, a highly reliable multicast service can be prov... /

2   Performance Evaluation of the Quadrics Interconnection Network - Petrini, Frachtenberg, Hoisie, Coll (2003)   (Correct)
In this paper we present an in-depth description of the Quadrics interconnection network (QsNET) and an experimental performance evaluation on a 64-node AlphaServer cluster. We explore several perform... / Cluster Computing -

2   Performance Prediction and Scheduling for Parallel Applications on.. - Schopf (1998)   (Correct)
xxiii 1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 A. High Performance Distributed Parallel... / Proceedings of the Cluster Computing Conference CCC March br is widely used in the cluster computing setting because it is easy

2   Operating System Structure and Processor Architecture for a Large.. - Alan Skousen Donald (1998)   (Correct)
Recent 64-bit microprocessors have made a huge 18.4 quintillion byte address space potentially available to applications and the operating system. Because current process-oriented operating systems an... / System to Support Modern Cluster Computing CSE Dept.ASU

2   Using Stochastic Intervals to Predict Application Behavior on.. - Schopf, Berman (1999)   (Correct)
Current distributed parallel platforms can provide the resources required to execute a scientic application eciently. However, when these platforms are shared by multiple users, the performance of th... / appear in the journal of cluster computing Technical Report

2   On the Design of a Demand-Based Network-Computing System: The Purdue.. - Kapadia, Fortes (1998)   (Correct)
Many of the systems that currently allow computing on the web target specific tools. Such solutions tend to be non-reusable in spite of the fact that they involve a significant amount of duplicated ef... /

2   Design and Evaluation of Smart Disk Architecture for Data-Intensive.. - Memik, Kandemir, Choudhary (2000)   (Correct)
power of large-scale applications are increasing rapidly. Clusters seem to be the most attractive architecture for such applications, due to their low costs and high scalability. On the other hand, sm... /

1   Mianjin is Gardens Point: A Parallel Language Taming Asynchronous.. - Roe, Szyperski (1997)   (Correct)
The Gardens language, Mianjin, supports task based parallel computation, which utilises Active Messages style asynchronous communication. Unlike raw Active Messages, which is a library, this is achi... / networks of workstations cluster computing Note that Mianjin is a br is not restricted to just cluster computing. The goals of Mianjin are

1   Switcherland - A Scalable Interconnection Structure for Distributed.. - Eberle (1997)   (Correct)
Switcherland is a scalable interconnection structure for distributed systems. It is scalable in that it uses switches that can serve as an I/O interconnection structure of a workstation as well as a... / of System Architectures on Cluster Computing. Elsevier br memory quality of service cluster computing. . Introduction

1   Experiments in Dynamic Load Balancing for Parallel Cluster Computing - Vesseur, Heederik, Overeinder, Sloot (1995)   (Correct)
this paper. We use the term job to indicate the largest entity of execution (program) consisting of one (serial program) or more cooperating tasks (parallel program). unknown Experiments in Dynamic Lo... / Load Balancing for Parallel Cluster Computing J.J.J. Vesseur R.N. br resources. Although such cluster computing systems provide the user

1   Cluster-MPI - An optimized MPI subset for configurable cluster.. - Grabowsky, al. (1997)   (Correct)
this paper we present Cluster-MPI -- an MPI subset that fulfils the requirements of our application class and gives a performance to the user that is close to the capabilities of the underlying hardwa... / communication systems for cluster computing such as SCI Fast Ethernet

1   Mesoscopic Analysis of Self-Evolution in an Artificial Chemistry - Dittrich, Ziegler, Banzhaf (1998)   (Correct)
In an algorithmic artificial chemistry the objects (molecules) are data structures and the interactions (reactions) among them are defined by an algorithm. The same object can appear in two forms: (1)... / chemistry chemical computing cluster analysis binary string

1   Heterogeneous By Design: An Environment for Exploiting Heterogeneity - Richard Larowe (1993)   (Correct)
Heterogeneity in computing environments is becoming increasingly common. Some consider this a problem, while others (including ourselves) prefer to think of it as a benefit. By exploiting the differen... /

1   Cache Algorithms Based on Adaptive Invalidation Reports for Mobile.. - Hu, Lee (1998)   (Correct)
this paper, we present three adaptive cache invalidation report methods, in which the server broadcasts different invalidation reports according to the update and query rates/patterns and client disco... /

1   Efficient Layering for High Speed Communication: the MPI over Fast.. - Lauria, Pakin, Chien (1999)   (Correct)
ching two communication layers, and our solutions as embodied in FM 2. 1. Introduction Dramatic advances in low-cost computing technology have combined to make cluster of PCs an attractive alternative... / Cluster Computing Efficient

1   Compiling for Heterogeneous Systems: A Survey and an Approach - McKinley, Moss, Singhai, Weaver.. (1995)   (Correct)
Large applications tend to contain several models of parallelism, but only a few of these map efficiently to the single model of parallelism embodied in a homogeneous parallel system. Heterogeneous pa... / when the machines are similar cluster computing. A virtual machine is often br . Tur L. H. Turcotte. Cluster computing. In Albert Y. Zomaya

1   Cluster Computing Architectures and Algorithms for Passive Sonar.. - George, Rosen, Markwell, Hopwood.. (1997)   (Correct)
This paper summarizes ongoing research and development efforts involving the design, modeling, simulation, experimentation, and analysis of distributed, parallel computing algorithms and architectures... / Cluster Computing Architectures and Algorithms

1   Parnass2: A cluster of Dual-Processor PCs - Schweitzer, Zumbusch, Griebel (1999)   (Correct)
We report on a cluster with 96 CPUs (48 Dual-Processor PCs running Linux 2.1.127) at our department, called Parnass2 1 [15]. The computing nodes are connected by a Myrinet, a Gigabit per second swit... / cluster in . Workshop Cluster Computing TU Chemnitz .

1   Congestion Control in Asynchronous, High-Speed Wormhole Routing.. - Leonardi, Neri, al. (1996)   (Correct)
High-speed networks use lightweight protocols and a simple switch architecture for achieving higher speeds. A lightweight switching technique for local area and campus environments is wormhole routing... / interconnect applications and cluster computing is the high latency due to

1   Computing in the RAIN: A Reliable Array of Independent Nodes - Vasken Bohossian (1998)   (Correct)
The RAIN project is a research collaboration between Caltech and NASA-JPL on distributed computing and data storage systems for future spaceborne missions. The goal of the project is to identify and d... / . Related Work Cluster computing systems such as the NOW br management and reliability in cluster computing systems. Well-known examples

1   Strings: A High-Performance Distributed Shared Memory for Symmetrical .. - Roy, Chaudhary (1998)   (Correct)
This paper introduces Strings, a high performance distributed shared memory system designed for clusters of symmetrical multiprocessors (SMPs). The distinguishing feature of this system is the use of ... / or switches to form a scalable computing cluster. Examples of this important br approach to using these computing clusters is to provide an illusion of

1   Active Ports: A Performance-oriented Operating System Support to Fast .. - G.Chiola (1998)   (Correct)
The Genoa Active Message MAchine (GAMMA) is an efficient communication layer for 100base-T clusters of Personal Computers running Linux. It is based on Active Ports, a communication mechanism derive... / thus enabling cost-effective cluster computing on base-T. Despite being

1   XTP as a Transport Protocol for Distributed Parallel Processing - Strayer (1994)   (Correct)
The Xpress Transfer Protocol (XTP) is a flexible transport layer protocol designed to provide efficient service without dictating the communication paradigm or the delivery characteristics that qualif... / solutions for many popular cluster computing environments use TCP and br paradigms important to cluster computing. An implementation of XTP is

1   FAILURE-RESILIENT COMPUTATIONS IN THE EcliPSe SYSTEM - Knop (1994)   (Correct)
Local or wide-area connected workstation cluster-based computation systems are inherently failure-prone, particularly for long running computations. In this work we introduce a variety of features for... / INTRODUCTION Cluster computing a low-cost alternative to br really designed to support cluster computing yield long communication

1   An Opportunity Cost Approach for Job Assignment and Reassignment in a .. - Amir (1998)   (Correct)
A new method is presented for job assignment to and reassignment between machines in a computing cluster. Our method is based on a theoretical framework that has been experimentally tested and show... / System for High Performance Cluster Computing Journal of Future br Reassignment in a Scalable Computing Cluster Yair Amir Baruch

1   ChaosLAN: Design and Implementation of a Gigabit LAN Using Chaotic.. - Mckenzie (1997)   (Correct)
In recent years, the Chaos Project at the University of Washingtonhas analyzed and simulated a dozen routing algorithms. Three new routing algorithms have been invented; of these, the chaotic routing ... / both a high-performance cluster computing environment for parallel

1   DAD - Distributed Adamo Database system at Hermes - Wander, Duren, Ferstl (1995)   (Correct)
tabase functionality requirements. 1 Introduction The initial goal for the DAD project was to provide detector calibration and geometry data for any given time period of the HERMES-experiment in a ce... / from different systems of a computing cluster. Software analysis on SMP

1   Native ATM Application Programmer Interface Testbed for Cluster-based .. - Dowd, al. (1996)   (Correct)
This paper investigates the use of ATM for cluster based computing. The need for a native ATM API is discussed as well as the performance of message passing libraries (MPL) that are written to use suc... / distributed based cluster computing. GDC there is a strong br are large factors limiting cluster computingfrom directly competing with

CiteSeer - citeseer.org - Terms of Service - Privacy Policy - Copyright © 1997-2002 NEC Research Institute