Search Results - "Vishkin, U."

Refine Results
  1. 1

    Mesh-of-Trees and Alternative Interconnection Networks for Single-Chip Parallelism by Balkan, A.O., Gang Qu, Vishkin, U.

    “…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. 2

    Bootstrapping free-space optical networks by Liu, F., Vishkin, U., Milner, S.

    “…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. 3
  4. 4
  5. 5

    An efficient distributed orientation algorithm (Corresp.) by Vishkin, U.

    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. 6

    Algorithmic approach to designing an easy-to-program system: Can it lead to a HW-enhanced programmer's workflow add-on? by Vishkin, U.

    “…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. 7

    Conflict-free access to multiple single-ported register files by Mueller, S.M., Vishkin, U.

    “…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. 8

    Efficient approximate and dynamic matching of patterns using a labeling paradigm by Sahinalp, S.C., Vishkin, U.

    “…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. 9

    Improving Run-Time Scheduling for General-Purpose Parallel Code by Tzannes, A., Barua, R., Vishkin, U.

    “…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. 10

    Power-Performance Comparison of Single-Task Driven Many-Cores by Keceli, F., Moreshet, T., Vishkin, U.

    “…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. 11

    Towards a theory of nearly constant time parallel algorithms by Gil, J., Matias, Y., Vishkin, U.

    “…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. 12

    An area-efficient high-throughput hybrid interconnection network for single-chip parallel processing by Balkan, Aydin O., Qu, Gang, Vishkin, Uzi

    “…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. 13

    A bootstrapping model for directional wireless networks by Milner, S., Llorca, J., Anibha, A., Vishkin, U.

    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. 14

    Some triply-logarithmic parallel algorithms by Berkman, O., Jaja, J., Krishnamurthy, S., Thurimella, R., Vishkin, U.

    “…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. 15

    XMT-GPU: A PRAM Architecture for Graphics Computation by DuBois, T.M., Lee, B., Yi Wang, Olano, M., Vishkin, U.

    “…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. 16

    Towards a First Vertical Prototyping of an Extremely Fine-Grained Parallel Programming Approach by Naishlos, Dorit, Nuzman, Joseph, Tseng, Chau-Wen, Vishkin, Uzi

    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. 17

    Deterministic Resource Discovery in Distributed Networks by Kutten, Shay, Peleg, David, Vishkin, Uzi

    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. 18
  19. 19
  20. 20