WorldCat Identities

Chien, Andrew Andai

Overview
Works: 29 works in 56 publications in 1 language and 284 library holdings
Genres: Academic theses  Conference papers and proceedings 
Roles: Author
Classifications: QA76.73.C652, 005.133
Publication Timeline
.
Most widely held works about Andrew Andai Chien
 
Most widely held works by Andrew Andai Chien
Concurrent Aggregates : supporting modularity in massively parallel programs by Andrew Andai Chien( Book )

7 editions published in 1993 in English and Undetermined and held by 203 WorldCat member libraries worldwide

Planar-adaptive routing : low-cost adaptive networks for multiprocessors by Andrew Andai Chien( Book )

5 editions published in 1991 in English and held by 13 WorldCat member libraries worldwide

Incremental inference of concrete types by John Plevyak( Book )

4 editions published in 1993 in English and held by 13 WorldCat member libraries worldwide

The Concert system : compiler and runtime support for efficient, fine-grained concurrent object-oriented programs by Andrew Andai Chien( Book )

2 editions published in 1993 in English and held by 9 WorldCat member libraries worldwide

The goal of the Concert project is to develop portable, efficient implementations of fine-grained concurrent object-oriented languages. Our approach incorporates careful program analysis and information management at every stage from the compiler to the runtime system. In this document, we outline the basic elements of the Concert approach. In particular, we discuss program analyses, program transformations, their potential payoff, and how they will be embodied in the Concert system. Initial performance results and specific plans for demonstrations and system development are also detailed."
Congestion control in routing networks by Andrew Andai Chien( Book )

3 editions published in 1986 in English and held by 8 WorldCat member libraries worldwide

Concurrent aggregates (CA) : an object-oriented language for fine-grained message-passing machines by Andrew Andai Chien( Book )

4 editions published in 1990 in English and held by 5 WorldCat member libraries worldwide

Fine-grained parallel machines exhibit great potential for high speed computation. Several machines such as the J-machine and the Mosaic C are projected to provide peak performance of 100's of billions of instructions per second in an air-cooled computer that fits in a cubic meter. While the hardware technology to build fine-grained machines is available, significant challenges remain in developing software systems to harness their computational power. To program massively-concurrent MIMD machines, programmers need tools for managing complexity. One important tool used in the sequential programming world is hierarchies of abstractions. Unfortunately, most concurrent object-oriented languages construct hierarchical abstractions from objects that serialize - serializing the abstractions. In machines with tens of thousands of processors, this unnecessary serialization can cause significant loss of concurrency. Tools for managing concurrency should not restrict or reduce program concurrency. Concurrent Aggregated (CA) provides multiple-access data abstraction tools, Aggregates, for managing program complexity. These tools can be used to implement abstractions with virtually unlimited potential for concurrency. Such tools allow programmers to modularize programs without reducing concurrency. These aggregates can be composed hierarchies of abstractions, allowing the structuring of a program to be highly concurrent at all levels. (kr)
Congestion control in routing networks by Andrew Andai Chien( )

2 editions published in 1986 in English and held by 4 WorldCat member libraries worldwide

Multistage routing networks present an attractive cost-effective method of interconnection for medium to large scale multiprocessors. Recent results concerning performance degradation in the presence of hot spots have raised serious questions about the robustness of previous performance estimates for these routing networks. Research to date has focused on a limited class of hot spots - those in which all the hot spot traffic is destined for the same memory address. We consider a more general kind of traffic imbalance - the hot spot traffic may be of arbitrary composition. By taking this more general view, we hope to understand a wider class of traffic imbalances. In this thesis, we define an analytic framework in which to study the problem of performance degradation due to hot spots. We characterize the performance degradation due to these hot spots. This degradation is very severe. We then employ approximate methods to estimate the time to congest the network, and the time to dissipate that congestion. These approximations are validate by extensive simulation of the model. We subsequently propose a solution to prevent performance degradation due to hot spot traffic imbalances
Proceedings of the seventh ACM SIGPLAN symposium on Principles and practice of parallel programming by Marc Snir( )

2 editions published between 1999 and 2004 in English and held by 2 WorldCat member libraries worldwide

Experience with concurrent aggregates (CA)O : implementation and programming by Andrew Andai Chien( Book )

2 editions published between 1990 and 1991 in English and held by 2 WorldCat member libraries worldwide

Object-oriented concurrent programming in CST by William J Dally( Book )

2 editions published in 1988 in English and held by 2 WorldCat member libraries worldwide

CST is a programming language based on Smalltalk-80 that supports concurrency using lock, asynchronous messages, and distributed objects. Distributed objects have their state distributed across many nodes of a machine, but are referred to by a single name. Distributed objects are capable of processing many messages simultaneously and can be used to efficiently connect together large collections of objects. They can be used to construct a number of useful abstractions for concurrency. This paper describes the CST language, gives examples of its use, and discusses an initial implementation. Keywords: Programming languages. (kt)
High Performance Virtual Machines( Book )

2 editions published in 2002 in English and held by 2 WorldCat member libraries worldwide

The primary goal of the High Performance Virtual Machines (HPVM) project was to reduce the effort required to build a high performance cluster and distributed applications by leveraging the investments and understanding of scalable parallel systems. The approach to reducing the programming effort required to build high performance distributed applications was to insulate the program with a uniform, portable abstraction - a High Performance Virtual Machine - with predictable, high performance characteristics. Success was achieved by delivering a large fraction of the underlying hardware performance, visualizing resources to provide portability and reduce the application building effort and delivering predictable, high performance computing. HPVM has produced several major software releases involving high performance communication libraries, complete cluster software systems, and improved versions of those systems on a variety of hardware and software platforms. These systems have been downloaded and deployed at top research universities, major computer companies and national research laboratories. Clusters of commodity systems connected by high-speed networks are an important computing element and serve as an important model for future computing environments. Technologies which effectively exploit distributed computational resources can tap this "cluster pool" to deliver high performance computing, dramatically increasing the computational power available for both high performance computing and high performance distributed applications
Experience with CST: programming and implementation by W Horwat( Book )

2 editions published in 1989 in English and held by 2 WorldCat member libraries worldwide

CST is an object-oriented concurrent programming language based on Small talk-80 that supports concurrency using locks, asynchronous messages, and distributed objects. In this paper, we describe CST: the language and its implementation. Example programs and initial programming experience with CST is described. An implementation of CST (Concurrent Small Talk) generates native code for the J-machine, a fine-grained concurrent computer. Some novel compiler optimizations developed in conjunction with that implementation are also described
Agile Objects: Component-Based Inherent Survivability( Book )

2 editions published in 2003 in English and held by 2 WorldCat member libraries worldwide

We have developed a framework called Agile Objects which leverages component object models and enables the construction of survivable systems that support increased application survivability through elusive technologies: location elusiveness, interface elusiveness, and dynamic elusiveness. Location elusiveness is the capability of application components to be reconfigured across distributed resources while the application is running and preserving the performance and real-time properties of the application both across and during the migration. In short, an application can flee systems that are likely (or already) compromised, dynamically reconfiguring to continue its mission. Interface elusiveness (a.k.a. High Performance Invocation Protection) enables a component middleware system to manage automatic change and configuration of application components and distributed object interfaces to maintain application security. Dynamic elusiveness is the capability to dynamically manage the dimensions of elusiveness in response to a complex and evolving security/intrusion environment. Both location and interface elusiveness are supported by Agile Objects in dynamic form. The project efforts have demonstrated location elusiveness, interface elusiveness, and dynamic elusiveness which enable the construction of component-based inherently survivable systems. These technologies were embedded in a component middleware which allows applications, based on component technologies, to exploit survivability capabilities
Techniques for Efficient Execution of Fine-grained Massively-Parallel Programs( Book )

2 editions published in 1997 in English and held by 2 WorldCat member libraries worldwide

The objective of the base project is to explore the use and implementation of object oriented techniques for high performance, high level programming. Object oriented languages are a high level approach of clear programming benefit but are typically much less efficient that traditional approaches embodied in Fortran and C. We evaluate the complexity of programming irregular applications, and the efficient implementation of such programs using novel program analysis and runtime techniques
The cancert system : computer and runtime support for efficient, fine-grained concurrent object-oriented programs by Andrew Andai Chien( Book )

1 edition published in 1993 in English and held by 1 WorldCat member library worldwide

Efficient general-purpose mechanism for data gathering with accuracy requirement in wireless sensor networks by Ryō Sugihara( )

1 edition published in 2006 in English and held by 1 WorldCat member library worldwide

A generic objective for a sensor network application is the gathering of data from a field of sensors. Because energy is often scarce in sensor networks, many techniques have been proposed to reduce data size within the network. These techniques either ignore the accuracy of the resulting data, or more often, provide no means for applications to control the resulting accuracy. However in many cases, applications have a quantitative requirement for sensor data accuracy, and the underlying system should meet that efficiently. In this paper, we describe a distributed algorithm that approximates and gathers data in an energy-efficient manner and strictly satisfies an application-provided accuracy requirement. This approximation is based on a hybrid data representation based on linear regression. A distinguishing feature of the proposed algorithm is that it absolutely does not require any models on statistical properties of data and noise, and needs only few general assumptions on sensor node topology. This feature enables the algorithm to serve as a general-purpose mechanism that can be widely used in many scenarios for data gathering-type applications. Simulation experiments with data traces from real environmental data show that it leverages the accuracy requirement to significantly reduce energy consumption
Efficient resource description and high quality selection for virtual grids by Yang-Suk Kee( )

1 edition published in 2004 in English and held by 1 WorldCat member library worldwide

Simple resource specification, resource selection, and effective binding are critical capabilities for Grid middleware. We describe the Virtual Grid, an abstraction for dynamic grid applications to deal with complex resource environments. Elements of the Virtual Grid include a novel resource description language (vgDL) and a resource selection and binding component (vgFAB), which accepts a vgDL specification and returns a Virtual Grid, that is, a set of selected and bound resources. The goals of vgFAB are efficiency, scalability, robustness to high resource contention, and the ability to produce results with quantifiable high quality. We present the design of vgDL, showing how it captures application-level resource abstractions using resource aggregates and connectivity amongst them. We present and evaluate a prototype implementation of vgFAB. Our results show that resource selection and binding for virtual grids of 10,000's of resources can scale up to grids with millions of resources, identifying good matches in less than one second. Further, these matches have quantifiable quality, enabling applications to have high confidence in the results. We demonstrate the effectiveness of our combined selection and binding approach in the presence of resource contention, showing the robust selection and binding can be achieved at moderate cost
Characterizing and evaluating desktop grids : an empirical study by Derrick Kondo( )

1 edition published in 2003 in English and held by 1 WorldCat member library worldwide

Desktop resources are attractive for running compute[r]-intensive distributed applications. Several systems that aggregate these resources in desktop grids have been developed. While these systems have been successfully used for a wide variety of high throughput applications there has been little insight into the detailed temporal structure of CPU availability of desktop grid resources. Yet, this structure is critical to characterize the utility of desktop grid platforms for both task parallel and even data parallel applications. We address the following questions: (i) What are the temporal characteristics of desktop CPU availability in an enterprise setting? (ii) How do these characteristics affect the utility of desktop grids? (iii) Based on these characteristics, can we construct a model of server "equivalents" for the desktop grids, which can be used to predict application performance? We present measurements of an enterprise desktop grid with over 220 hosts running the Entropia commercial desktop grid software. We utilize these measurements to characterize CPU availability and develop a performance model for desktop grid applications for various task granularities, showing that there is an optimal task size. We then introduce a new metric, cluster equivalence, which we use to quantify the utility of the desktop grid relative to that of a dedicated cluster
OptIPuter system software framework by Andrew Andai Chien( )

1 edition published in 2004 in English and held by 1 WorldCat member library worldwide

We describe a shared perspective and assumptions looking up and down the OptIPuter system software stack. The discussion clearly defines and justifies the assumptions and model for each perspective, starting with the network hardware architecture, the integrating model of distributed virtual computers and the supporting technologies of group transport protocol, multi-endpoint communication, and shared lambda-grid storage
Workloads and performance metrics for evaluating parallel interconnects by Andrew Andai Chien( )

1 edition published in 1994 in English and held by 1 WorldCat member library worldwide

 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.69 (from 0.66 for The cancer ... to 0.99 for Chien, And ...)

Concurrent Aggregates : supporting modularity in massively parallel programs
Covers
Alternative Names
Andai Chien, Andrew

Chien, A.A.

Chien, Andrew A.

Languages
English (47)