Shared State for Client-Server Mining ∗ (2008)
S. Parthasarathy, S. Dwarkadas
For many organizations the explosive growth in data collection techniques and database technology has resulted in large and dynamically growing datasets. These organizations are increasingly turning...
4 M.J. Flynn, Some computer organizations and their effectiveness, IEEE (2008)
Amza C, A. L. Cox, S. Dwarkadas, P. Keleher, R. Rajamony, H. Lu, ...
and W.Zwaenepoel. Treadmarks: Shared memory computing on networks of workstations, to appear in IEEE Computer, (draft copy): www.cs.rice.edu/willy/TreadMarks/papers.html.
S. Parthasarathy, M. J. Zaki, M. Ogihara, S. Dwarkadas
The discovery of frequent sequences in temporal databases is an important data mining problem. Most current work assumes that the database is static, and a database update requires rediscovering all...
S. Parthasarathy, M. J. Zaki, M. Ogihara, S. Dwarkadas
The discovery of frequent sequences in temporal databases is an important data mining problem. Most current work assumes that the database is static, and a database update requires rediscovering all...
Shared State for Client-Server Mining (2007)
S. Parthasarathy, S. Dwarkadas
For many organizations the explosive growth in data collection techniques and database technology has resulted in large and dynamically growing datasets. These organizations are increasingly turning...
Dynamically managing the communication-parallelism trade-off in future clustered processors (2003)
Balasubramonian, Rajeev, Dwarkadas, S.; Albonesi, D. H.
Clustered microarchitectures are an attractive alternative to large monolithic superscalar designs due to their potential for higher clock rates in the face of increasingly wire-delay-constrained...
Dynamically allocating processor resources between nearby and distant ILP (2001)
Balasubramonian, Rajeev, Dwarkadas, S.; Albonesi, D. H.
Modern superscalar processors use wide instruction issue widths and out-of-order execution in order to increase instruction-level parallelism (ILP). Because instructions must be committed in order so...
Combining Compile-Time and Run-Time Support for Efficient Distributed Shared Memory (1999)
Zwaenepoel, Willy, Cox, A.L., Dwarkadas, S., Lu, H., Rajamony, R.
We describe an integrated compile-time and run-time system for efficient shared memory parallel computing on distributed memory machines. The combined system presents the user with a shared memory...
Adaptive Protocols for Software Distributed Shared Memory (1999)
Amza, C., Cox, A.L., Dwarkadas, S., Jin, L.-J., Rajamani, K., Zwaenepoel, W.
We demonstrate the benefits of software shared memory protocols that adapt at run-time to the memory access patterns observed in the applications. This adaptation is automatic, no user annotations...
Active Mining in a Distributed Setting (1999)
S. Parthasarathy, S. Dwarkadas, M. Ogihara
Most current work in data mining assumes that the data is static, and a database update requires re-mining both the old and new data. In this article, we propose an alternative approach. We outline a...
Active Mining in a Distributed Setting (1999)
S. Parthasarathy, S. Dwarkadas, M. Ogihara
Most current work in data mining assumes that the data is static, and a database update requires re-mining both the old and new data. In this article, we propose an alternative approach. We outline a...
Incremental and Interactive Sequence Mining (1999)
S. Parthasarathy, M. J. Zaki, M. Ogihara, S. Dwarkadas
The discovery of frequent sequences in temporal databases is an important data mining problem. Most current work assumes that the database is static, and a database update requires rediscovering all...
Incremental and Interactive Sequence Mining (1999)
S. Parthasarathy, M. J. Zaki, M. Ogihara, S. Dwarkadas
The discovery of frequent sequences in temporal databases is an important data mining problem. Most current work assumes that the database is static, and a database update requires rediscovering all...
Incremental and Interactive Sequence Mining (1999)
S. Parthasarathy, M. J. Zaki, M. Ogihara, S. Dwarkadas
The discovery of frequent sequences in temporal databases is an important data mining problem. Most current work assumes that the database is static, and a database update requires rediscovering all...
Quantifying the Performance Differences Between PVM and TreadMarks (1997)
Lu, H., Dwarkadas, S., Cox, A.L., Zwaenepoel, W.
We compare two systems for parallel programming on networks of workstations: Parallel Virtual Machine (PVM) a message passing system, and TreadMarks, a software distributed shared memory (DSM)...
Evaluating the Trade-Offs in the Parallelization of Probabilistic Search Algorithms (1997)
R. L. Carceroni, W. Meira, Jr., R. Stets, S. Dwarkadas
In this work, we propose a speculative parallelization strategy for Probabilistic Search algorithms. We design a parallel version of one such algorithm for a real--time computer vision problem with...
TreadMarks: Shared Memory Computing on Networks of Workstations, (1996)
Amza, C., Cox, A.L., Dwarkadas, S., Keleher, P., Lu, H., Rajamony, R., ...
TreadMarks supports parallel computing on networks of workstations by providing the application with a shared memory abstraction. Shared memory facilitates the transition from sequential to parallel...
An integrated compile-time/run-time software distributed shared memory system (1996)
Dwarkadas, S., Cox, A.L., Zwaenepoel, W.
On a distributed memory machine, hand-coded message passing leads to the most efficient execution, but it is difficult to use. Parallelizing compilers can approach the performance of hand-coded...
An Evaluation of Software Release-Consistent Protocols (1995)
Zwaenepoel, W, Cox, A.L., Dwarkadas, S., Keleher, P.
This paper presents an evaluation of three software implementations of release consistency. Release consistent protocols allow data communication to be aggregated, and multiple writers to...
Integrating Parallelization Strategies for Linkage Analysis (1995)
Cox, A.L., Dwarkadas, S., Gupta, S.K., Schaffer, A.A., Zwaenepoel, W
We describe a second parallel implementation of the ILINK program from the LINKAGE package that improves on our previous implementation [Human Heredity 44 (1994), pp. 127-141]. To improve running...
Parallelization of General Linkage Analysis Problems (1994)
Cottingham, R.W., Cox, A.L., Dwarkadas, S., Keleher, P., Schaffer, A.A., Zwaenepoel, W
We describe a parallel implementation of a genetic linkage analysis program that achieves good speedups, even for analyses on a single pedigree and with a single starting recombination fraction...
TreadMarks: Distributed Shared Memory on Standard Workstations and Operating Systems (1994)
Cox, A.L., Dwarkadas, S., Keleher, P.
TreadMarks is a distributed shared memory (DSM) system for standard Unix systems such as SunOS and Ultrix. This paper presents a performance evaluation of TreadMarks running on Ultrix using...
TreadMarks: Distributed Shared Memory on Standard Workstations and Operating Systems (1994)
Cox, A.L., Dwarkadas, S., Keleher, P., Zwaenepoel, Willy
TreadMarks is a distributed shared memory (DSM) system for standard Unix systems such as SunOS and Ultrix. This paper presents a performance evaluation of TreadMarks running on Ultrix using...
Execution-Driven Simulation of Multiprocessors: Address and Timing Analysis (1994)
S. Dwarkadas, J. R. Jump, J. B. Sinclair
This paper describes and evaluates an efficient execution-driven technique for the simulation of multiprocessors that includes the simulation of system memory and is driven by real program workloads....
Cox, A.L., Dwarkadas, S., Keleher, P., Zwaenepoel, W
We evaluate the effect of processor speed, network characteristics, and software overhead on the performance of release-consistent software distributed shared memory. We examine five different...
Execution-Driven Simulation Of Shared-Memory Multiprocessors (1993)
Dwarkadas Jump, S. Dwarkadas, J. R. Jump, R. Mukherjee, J. B. Sinclair
This paper describes an efficient execution-driven technique for the simulation of shared-memory multiprocessors driven by real programs. Our simulator offers substantial advantages in terms of...