#### Filter Results:

- Full text PDF available (33)

#### Publication Year

1993

2017

- This year (3)
- Last 5 years (19)
- Last 10 years (36)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- David E. Culler, Richard M. Karp, +5 authors Thorsten von Eicken
- PPOPP
- 1993

A vast body of theoretical research has focused either on overly simplistic models of parallel computation, notably the PRAM, or overly specific models that have few representatives in the real world. Both kinds of models encourage exploitation of formal loopholes, rather than rewarding development of techniques that yield performance across a range of… (More)

- David E. Culler, Richard M. Karp, +5 authors Thorsten von Eicken
- Commun. ACM
- 1996

enough to be generally useful and to keep the algorithm analysis tractable. Ideally, producing a better algorithm under the model should yield a better program in practice. The Parallel Random Access Machine (PRAM) [8] is the most popular model for representing and analyzing the complexity of parallel algorithms. A LogP A Practic Parallel

In many distributed-memory parallel computers the only built-in communication primitive is point-to-point message transmission, and more powerful operations such as broadcast and synchronization must be realized using this primitive. Within the LogP model of parallel computation we present algorithms that yield optimal communication schedules for several… (More)

- Eunice E. Santos, Eugene Santos
- International Journal on Artificial Intelligence…
- 2001

- Eunice E. Santos, Gayathri Muthukrishnan
- 18th International Parallel and Distributed…
- 2004

Summary form only given. We design parallel Monte Carlo algorithms for the Ising spin model on a hierarchical cluster. A hierarchical cluster can be considered as a cluster of homogeneous nodes which are partitioned into multiple supernodes such that communication across homogenous clusters are represented by a supernode topological network. We consider… (More)

- Eunice E. Santos, Long Pan, Dustin Arendt, Morgan Pittkin
- SMC
- 2006

- Eunice E. Santos
- J. Parallel Distrib. Comput.
- 1999

Since many distributed-memory machines rely only on point-to-point communication between processors, various broadcast operations must be created using this type of primitive. In this paper we consider the fundamental problem of broadcasting k-items from one processor to all the remaining processors on a parallel machine. Using point-to-point communication… (More)

- Eunice E. Santos, Pei-Yue Pauline Chu
- J. Math. Model. Algorithms
- 2003

With the proliferation of the Internet and rapid development of information and communication infrastructure, E-governance has become a viable option for effective deployment of government services and programs. Areas of E-governance such as Homeland security and disaster relief have to deal with vast amounts of dynamic heterogeneous data. Providing rapid… (More)

- Eugene Santos, John Thomas Wilkinson, Eunice E. Santos
- Int. J. Approx. Reasoning
- 2011

We address the problem of information fusion in uncertain environments. Imagine there are multiple experts building probabilistic models of the same situation and we wish to aggregate the information they provide. There are several problems we may run into by naively merging the information from each. For example, the experts may disagree on the probability… (More)