Concurrent aggregates (CA)

Chien, Andrew A.; Dally, W. J.

doi:10.1145/99164.376303

Cited by 17 publications

(7 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Chien et al introduced Concurrent Aggregates (CAs) as a language abstraction for expressing parallel data structures in a modular fashion [Chien and Dally 1990]. This work is concerned with the language issues of supporting a distributed parallel object model for efficient construction of parallel applications in a message-passing environment.…”

Section: Distributed Systems: Fos and Dsos Fragmented Objects(fos)mentioning

confidence: 99%

Experience distributing objects in an SMMP OS

Appavoo

Silva

Krieger

et al. 2007

ACM Trans. Comput. Syst.

View full text Add to dashboard Cite

Designing and implementing system software so that it scales well on shared-memory multiprocessors (SMMPs) has proven to be surprisingly challenging. To improve scalability, most designers to date have focused on concurrency by iteratively eliminating the need for locks and reducing lock contention. However, our experience indicates that locality is just as, if not more, important and that focusing on locality ultimately leads to a more scalable system.In this paper, we describe a methodology and a framework for constructing system software structured for locality, exploiting techniques similar to those used in distributed systems. Specifically, we found two techniques to be effective in improving scalability of SMMP operating systems: (i) an object-oriented structure that minimizes sharing by providing a natural mapping from independent requests to independent code paths and data structures, and (ii) the selective partitioning, distribution, and replication of object implementations in order to improve locality. We describe concrete examples of distributed objects and our experience implementing them. We demonstrate that the distributed implementations improve the scalability of operating-system-intensive parallel workloads.

show abstract

Section: Distributed Systems: Fos and Dsos Fragmented Objects(fos)mentioning

confidence: 99%

Experience distributing objects in an SMMP OS

Appavoo

Silva

Krieger

et al. 2007

ACM Trans. Comput. Syst.

View full text Add to dashboard Cite

show abstract

“…The concept of Aggregate is defined as a collection of objects referenced by a single aggregate name [8]. An addressing mechanism facilitates the cooperation between objects within the aggregate and users of the aggregate.…”

Section: Reusable Collectionmentioning

confidence: 99%

Integrated Collections: Approach to Software Component Reuse

Haddad

2006

Third International Conference on Information Technology: New Generations (ITNG'06)

View full text Add to dashboard Cite

Software reuse has yet to offer well-defined methodologies and mature technologies for developing applications with reuse. Implementing a successful reuse initiative to realize the perceived benefits of reuse requires initial investment that makes the cost of reuse prohibitive for many organizations. The most common form of reusable assets is source code. In some estimates, domainspecific components represent up to 65% of the application size. One approach to effective reuse practices focus on domain-specific components. This work investigates software reuse practices and presents an integrated approach to component-based development to motivate domain-specific component reuse with emphasis on source code artifacts. The approach defines collections of reusable components that are integrated into the development environment. The concept of generic interface is also utilized to define a wrapper interface mechanism to manage and control the interfacing of reusable collections with applications in the domain of interest. The approach is mainly based on programming effort and does not require additional effort dealing with the managerial and organizational aspects of implementing comprehensive reuse initiatives.

show abstract

“…Our work is quite similar to pC++ [8], but adds migration and reductions. Unlike Concurrent Aggregates [9], Linda [7], or Orca [10], there is no duplication or replication--message sends address exactly one array element across the entire machine. This work is complemented by fast collective communication libraries such as [11]; but not dependent on them.…”

Section: Introductionmentioning

confidence: 99%

Supporting dynamic parallel object arrays

Lawlor

Kalé

2001

Proceedings of the 2001 Joint ACM-ISCOPE Conference on Java Grande

View full text Add to dashboard Cite

SUMMARYWe present efficient support for generalized arrays of parallel data driven objects. Array elements are regular C++ objects, and are scattered across the parallel machine. An individual element is addressed by its 'index', which can be an arbitrary object rather than a simple integer. For example, an array index can be a series of numbers, supporting multidimensional sparse arrays; a bit vector, supporting collections of quadtree nodes; or a string. Methods can be invoked on any individual array element from any processor, and the elements can participate in reductions and broadcasts. Individual elements can be created or deleted dynamically at any time. Most importantly, the elements can migrate from processor to processor at any time. We discuss support for message delivery and collective operations in the face of such dynamic behavior. The migration capabilities of array elements have proven extremely useful, for example, in implementing flexible load balancing strategies and for exploiting workstation clusters adaptively. We present the design, an implementation, and performance results.

show abstract

Concurrent aggregates (CA)

Cited by 17 publications

References 8 publications

Experience distributing objects in an SMMP OS

Experience distributing objects in an SMMP OS

Integrated Collections: Approach to Software Component Reuse

Supporting dynamic parallel object arrays

Contact Info

Product

Resources

About