An address decoder is a small hardware unit that uses an address to index and place the data into memory units including cache memories. In current CPU cache designs there is a single decoder unit which serves to place data into the cache. In this paper we describe a technique to reduce contention on CPU’s caches through the use of multiple address decoders. We argue that by using multiple deco...

Many scientific and engineering applications involve the inversion of large matrices or solving systems of linear algebraic equations. Solving these problems with proven algorithms for direct methods can take very long to compute, as they depend on the size of the matrix. The computational complexity of the Monte Carlo methods depend only on the number of chains and the length of those chains a...

A method, termed approximate splitting, is proposed to model the node distribution that results when the PR quadtree is used to store point data drawn from a uniform distribution. This method can account for the aging and phasing phenomena which are common in most hierarchical data structures. Approximate splitting is also shown to be capable of being adapted to model the node distribution of t...

Continuous process improvement (CPI) may require a BPEL process to be split amongst different participants. In this paper, we enable splitting standard BPEL without any extensions or new middleware. We present a solution that uses a BPEL process, partition information, and results of data analysis to produce a BPEL process for each participant. The collective behavior of these participant proce...

The most accurate way to measure the energy levels for the O ii 2p 3 ground configuration has been from the forbidden lines in planetary nebulae. We present an analysis of modern planetary nebula data that nicely constrain the splitting within the 2 D term and the separation of this term from the ground 4 S 3/2 level. We extend this method to H ii regions using high-resolution spectroscopy of t...

Non-systematic channel encoding can be superior to systematic encoding in the presence of redundancy in the transmitted data. We consider classes of non-systematic lowdensity parity-check (LDPC) codes based on scrambling or splitting redundant data bits into coded bits. Scrambling and splitting are achieved by cascading a sparse matrix or an inverse of a sparse matrix, respectively, with an LDP...

We analyze splitting algorithms for a class of two-dimensional fluid equations, which includes the incompressible Navier–Stokes equations and the surface quasi-geostrophic equation. Our main result is that the Godunov and Strang splitting methods converge with the expected rates provided the initial data are sufficiently regular.

We provide a new analytical approach to operator splitting for equations of the type ut = Au + B(u) where A is a linear operator and B is quadratic. A particular example is the Korteweg–de Vries (KdV) equation ut−uux +uxxx = 0. We show that the Godunov and Strang splitting methods converge with the expected rates if the initial data are sufficiently regular.

PLASMA, University of Massachusetts Amherst R A 09/2016 Present • Developed F, a dynamic tier splitting tool for JavaScript that allows users to write a single program for a web application, instead of two in the traditional tiered application. Implemented dynamic code splitting techniques that preserve security guarantees for private data through Information Flow Control.