Chad Yoshikawa

Learn More
Individual machines are no longer sufficient to handle the offered load to many Internet sites. To use multiple machines for scalable performance, load balancing, fault transparency, and backward compatibility with URL naming must be addressed. A number of approaches have been developed to provide transparent access to multi-server Internet services(More)
We present a systematic performance assessment of the hardware and software that provides the interface between applications and emerging high-speed networks. Using LogP as a conceptual framework and Active Messages as the communication layer, we devise a set of communication microbenchmarks. These generate a graphical signature from which we extract the(More)
The UC Berkeley Network of Workstations (NOW) project demonstrates a new approach to largescale system design enabled by technology advances that provide inexpensive, low latency, high bandwidth, scalable interconnection networks. This paper provides an overview of the hardware and software architecture of NOW and reports on the performance obtained at each(More)
This paper describes a set of microbenchmarks f i r measuring the performance characteristics of MPI impkmentatwns. We explain the rationale behind the benchmarks ad present the benchmark results on the Intel Paragon, IBM SP2, and SGI Power Challenge. O w measurements reveal how the hardware architecture and the underlying MPI implementation afject the(More)
The burgeoning popularity of the Web is pushing against the performance limits of the underlying infrastructure, presenting a number of difficult challenges for the Web as a system. We believe that resources such as connectivity, storage, computation, latency, and bandwidth are likely to remain constrained in the future. Thus, we are building a higher level(More)
In this paper, we argue for the power of providing a common set of OS services to wide area applications, including mechanisms for resource discovery, persistent storage, remote process execution, resource management, authentication, and security. On a single machine, application developers can rely on the local operating system to provide these(More)
Application-level network relays possess many desirable properties, including support for communication between disconnected clients, increasing bandwidth between distant clients, and enabling routing around Internet failures. One problem not considered by existing systems is how to assign client load to relay servers in order to maximize throughput of the(More)
Maximal flows reach at least a 1/2 approximation of the maximum flow in client-server networks. By adding 1 additional time round to any distributed maximal flow algorithm we show how this 1/2-approximation can be improved on boundeddegree networks. We call these modified maximal flows ‘locally fair’ since there is a measure of fairness prescribed to each(More)