Searching for authors named "Anne Rogers" – sorted by Relevance.
30 documents found, showing 1 through 10.
Next 10 →
-
Understanding Language Support for Irregular Parallelism
- …While software support for array-based, data-parallel algorithms has been studied extensively, less attention has been devoted to irregular parallel applications. The majority of these applications are unstructured, that is, they possess asynchronous components that do not fit the data-parallel mode…
- Cited by 2 (1 self) – Add To MetaCart
-
A STUDY of the EFFECTS OF ORDERING, PARTITIONING AND FACTORIZATION ALGORITHMS ON DISTRIBUTED SPARSE Cholesky Factorization
- …. In this paper, we perform a comprehensive evaluation of ordering, partitioning, and factorization algorithms under a unified framework. Previous research in distributed, sparse Cholesky factorization has considered each of the stages in the factorization process --- ordering, partitioning and num…
- Cited by 1 (1 self) – Add To MetaCart
-
Software Support for Speculative Loads
- …This paper describes a simple hardware mechanism and related compiler support for software-controlled speculative loads. The compiler issues speculative load instructions based on anticipated data references and the ability of the memory system to hide memory latency in high-performance processors.…
- Cited by 60 (3 self) – Add To MetaCart
-
Compiling for Distributed Memory Architectures
- …this paper, we report on one such system. The cornerstone of our approach is to let the mapping of data on to processors drive process decomposition. The idea underlying our approach is to enable the programmer to write and debug his program in a high-level language using standard high-level abstrac…
- Cited by 18 (0 self) – Add To MetaCart
-
UMM: A dynamically adaptive, unstructured multicast overlay
- …Abstract- The simplicity of multicast as a communication primitive belies its broad utility as a building block for distributed applications. Nevertheless, creating and maintaining multicast structures can be challenging, particularly when networks are transient and/or dynamic. We introduce a new un…
- Add To MetaCart
-
Hancock: A language for analyzing transactional data streams
- ……
- Cited by 1 (1 self) – Add To MetaCart
-
Hancock: A Language for Processing Very Large-Scale Data
- …A signature is an evolving customer profile computed from call records. AT&T uses signatures to detect fraud and to target marketing. Code to compute signatures can be difficult to write and maintain because of the volume of data. We have designed and implemented Hancock, a C-based domain-specific p…
- Cited by 3 (3 self) – Add To MetaCart
-
In Search of Simplicity: A Self-Organizing Group Communication Overlay
- …Group communication primitives have broad utility as building blocks for distributed applications. The challenge is to create and maintain the distributed structures that support these primitives while accounting for volatile end-nodes and variable network characteristics. Most solutions proposed to…
- Cited by 1 (1 self) – Add To MetaCart
-
A Comparison Study of Heuristics for Mapping Parallel Algorithms to Message-Passing Multiprocessors
- …This paper presents a comparison study of popular clustering and mapping heuristics which are used to map task-flow graphs to message-passing multiprocessors. To this end, we use task-graphs which are representative of important scientific algorithms running on data-sets of practical interest. The a…
- Cited by 1 (0 self) – Add To MetaCart
-
Functional Algorithm Simulation Of The Fast Multipole Method: Architectural Implications
- …Functional Algorithm Simulation is a methodology for predicting the computation and communication characteristics of parallel algorithms for a class of scientific problems, without actually performing the expensive numerical computations involved. In this paper, we use Functional Algorithm Simula…
- Cited by 6 (2 self) – Add To MetaCart
Showing 1 through 10.
Next 10 →
