Most client-side applications running on multicore processors are likely to be irregular programs that deal with complex, pointerbased data structures such as large sparse graphs and trees. However, we understand very little about the nature of parallelism in irregular algorithms, let alone how to exploit it effectively on multicore processors. In this paper, we show that, although the behavior...

While both fundamental limits and system implementations are well understood for the point-to-point communication system, much less is developed for general communication networks. This thesis contributes towards the design and analysis of advanced coding schemes for multi-user communication networks with structured codes. The first part of the thesis investigates the usefulness of lattice code...

Networks of workstations (NOWs) are becoming increasingly popular as a cost-effective alternative to parallel computers. These networks allow the customer to connect processors using irregular topologies, providing the wiring flexibility, scalability, and incremental expansion capability required in this environment. Some of these networks use source routing and wormhole switching. In particula...

A number of recent papers have provided evidence that practical design questions about neural networks may be tackled theoretically by studying the behavior of random networks. However, until now the tools available for analyzing random neural networks have been relatively ad hoc. In this work, we show that the distribution of pre-activations in random neural networks can be exactly mapped onto...

The primary goal of digital physics research is to provide a description of the physical universe in terms of simple programs. One approach to attaining this goal is creating a toolbox of algorithms that reproduce the behavior of basic quantum phenomena. As a step in this direction, a simple pseudo-particle algorithm has been developed that exhibits rotationally invariant, glider-like motion ac...

2014 The two-dimensional random Boolean networks suggested by Kauffman have a transition to chaos. We find by Monte Carlo simulation the periods of the limit cycles, both for each site as well as for the lattice as a whole, at the transition point and away from it, for the square lattice. The triangular lattice seems to have the same fractal dimensions as the square lattice. J. Physique 48 (198...