Search Results - "Vishkin, U."
-
1
Mesh-of-Trees and Alternative Interconnection Networks for Single-Chip Parallelism
Published in IEEE transactions on very large scale integration (VLSI) systems (01-10-2009)“…In single-chip parallel processors, it is crucial to implement a high-throughput low-latency interconnection network to connect the on-chip components,…”
Get full text
Journal Article -
2
Bootstrapping free-space optical networks
Published in IEEE journal on selected areas in communications (01-12-2006)“…We introduce a challenging problem in establishing and initially configuring or bootstrapping a Free Space Optical (FSO) network. In such networks, it is…”
Get full text
Journal Article -
3
Pattern matching in a digitized image
Published in Algorithmica (01-11-1994)Get full text
Journal Article -
4
Parallel construction of a suffix tree with applications
Published in Algorithmica (01-11-1988)Get full text
Journal Article -
5
An efficient distributed orientation algorithm (Corresp.)
Published in IEEE transactions on information theory (01-07-1983)“…An algorithm for constructing and maintaining full information on the structure of a communication network is presented. The algorithm uses distributed…”
Get full text
Journal Article -
6
Algorithmic approach to designing an easy-to-program system: Can it lead to a HW-enhanced programmer's workflow add-on?
Published in 2009 IEEE International Conference on Computer Design (01-10-2009)“…Our earlier parallel algorithmics work on the parallel random-access-machine/model (PRAM) computation model led us to a PRAM-On-Chip vision: a comprehensive…”
Get full text
Conference Proceeding -
7
Conflict-free access to multiple single-ported register files
Published in Proceedings - International Parallel Processing Symposium (1997)“…Presents a novel static algorithm for mapping values to multiple register files. The algorithm is based on the edge-coloring of a bipartite graph. It at lows…”
Get full text
Conference Proceeding Journal Article -
8
Efficient approximate and dynamic matching of patterns using a labeling paradigm
Published in Annual Symposium on Foundations of Computer Science (1996)“…A key approach in string processing algorithmics has been the labeling paradigm which is based on assigning labels to some of the substrings of a given string…”
Get full text
Conference Proceeding Journal Article -
9
Improving Run-Time Scheduling for General-Purpose Parallel Code
Published in 2011 International Conference on Parallel Architectures and Compilation Techniques (01-10-2011)“…Summary form only given. Today, almost all desktop and laptop computers are shared-memory multicores, but the code they run is over whelmingly serial. High…”
Get full text
Conference Proceeding -
10
Power-Performance Comparison of Single-Task Driven Many-Cores
Published in 2011 IEEE 17th International Conference on Parallel and Distributed Systems (01-12-2011)“…Many-cores, processors with 100s of cores, are becoming increasingly popular in general-purpose computing, yet power is a limiting factor in their performance…”
Get full text
Conference Proceeding -
11
Towards a theory of nearly constant time parallel algorithms
Published in [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science (1991)“…It is demonstrated that randomization is an extremely powerful tool for designing very fast and efficient parallel algorithms. Specifically, a running time of…”
Get full text
Conference Proceeding -
12
An area-efficient high-throughput hybrid interconnection network for single-chip parallel processing
Published in 2008 45th ACM/IEEE Design Automation Conference (08-06-2008)“…Single-chip parallel processing requires high bandwidth between processors and on-chip memory modules. A recently proposed Mesh-of-Trees (MoT) network provides…”
Get full text
Conference Proceeding -
13
A bootstrapping model for directional wireless networks
Published in IEEE communications letters (01-12-2006)“…Initially configuring or bootstrapping a connected topology in directional wireless networks is a challenging problem, especially when nodes only have local…”
Get full text
Journal Article -
14
Some triply-logarithmic parallel algorithms
Published in Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science (1990)“…It is established that several natural problems have triply logarithmic, or even faster, optimal parallel algorithms. These problems include: merging two…”
Get full text
Conference Proceeding -
15
XMT-GPU: A PRAM Architecture for Graphics Computation
Published in 2008 37th International Conference on Parallel Processing (01-09-2008)“…The shading processors in graphics hardware are becoming increasingly general-purpose. We test, through simulation and benchmarking, the potential performance…”
Get full text
Conference Proceeding -
16
Towards a First Vertical Prototyping of an Extremely Fine-Grained Parallel Programming Approach
Published in Theory of computing systems (01-09-2003)“…Explicit multithreading (XMT) is a parallel programming approach for exploiting on-chip parallelism. XMT introduces a computational framework with (1) a simple…”
Get full text
Journal Article -
17
Deterministic Resource Discovery in Distributed Networks
Published in Theory of computing systems (01-09-2003)“…The resource discovery problem was introduced by Harchol-Balter, Leighton, and Lewin. They developed a number of algorithms for the problem in the weakly…”
Get full text
Journal Article -
18
Editor's note
Published in IEEE transactions on computers (01-10-2000)Get full text
Journal Article -
19
Editor's note
Published in IEEE transactions on computers (01-10-2000)Get full text
Journal Article -
20
Editor's note
Published in IEEE transactions on computers (01-10-2000)Get full text
Journal Article