We argue that some of the parameters in the laws of Nature would be well understood, under the assumption that there is an influence from the future as well as from the past, in the sense that the principle of locality (or causality) is not valid at the fundamental level. However, locality is supposed to be broken only in the mild way that all the non-local influence comes from integrals over t...

Many modern applications of AI such as web search, mobile browsing, image processing, and natural language processing rely on finding similar items from a large database of complex objects. Due to the very large scale of data involved (e.g., users' queries from commercial search engines), computing such near or nearest neighbors is a non-trivial task, as the computational cost grows significant...

Pattern matching on large graphs is the foundation for a variety of application domains. The continuously increasing size of the underlying graphs requires highly parallel in-memory graph processing engines that need to consider non-uniform memory access (NUMA) and concurrency issues to scale up on modern multiprocessor systems. To tackle these aspects, a fine-grained graph partitioning becomes...

Recent work in deep learning has created a voracious demand for more compute cycles, but with the slowdown of Moore’s law, CPUs cannot keep up with the demand. Thus, attention has turned to massively-parallel hardware accelerators, ranging from new processing units designed specifically for deep learning to the repurposing of existing technologies like Fieldprogrammable gate arrays (FPGAs) and ...

In this paper, we implement some notable hierarchical or decision-tree-based packet classification algorithms such as extended grid of tries (EGT), hierarchical intelligent cuttings (HiCuts), HyperCuts, and hierarchical binary search (HBS) on an IXP2400 network processor. By using all six of the available processing microengines (MEs), we find that none of these existing packet classification a...

among different discretization approaches, finite difference method (fdm) is widely used for acoustic and elastic full-wave form modeling. an inevitable deficit of the technique, however, is its sever requirement to computational resources. a promising solution is parallelization, where the problem is broken into several segments, and the calculations are distributed over different processors. ...

In this paper we consider an imperfect production system which produces good and defective items and assume that defective items can be reworked. Due to the nature of rework process we do not restrict the rework rate to be equal to normal production rate or constant and assume that it is a random variable with an arbitrary distribution function. We also assume as it is true in most real world s...

The exploitation of data locality in parallel computers is paramount to reduce the memory traac and communication among processing nodes. We focus on the exploitation of locality by Parallel Radix sort. The original Parallel Radix sort has several communication steps in which one sorting key may have to visit several processing nodes. In response to this, we propose a reorganization of Radix so...