Search Results

Counterpoint: Parallel Programming Wall and Multicore Software Spiral: Denial Hence Crisis.

• Authors : Vishkin, Uzi¹

Subjects: *RANDOM access memory; *COMPUTER storage devices; *COMPUTERS

• Source: Communications of the ACM. Sep2022, Vol. 65 Issue 9, p32-34. 3p.

Record details

SUPER PCS.

Subjects: *PRODUCT design; *SUPERCOMPUTERS; *PARALLEL processingVISHKIN, Uzi

• Source: Communications of the ACM. Sep2007, Vol. 50 Issue 9, p8-8. 1/5p.

Record details

USER WISH LIST.

• Authors : Ames, Ben

Subjects: COMPUTER engineering; COMPUTERS; TECHNOLOGICAL innovationsUNITED States

• Source: Computerworld. 9/10/2007, Vol. 41 Issue 37, p50-50. 1/4p.

Record details

Oblivious Network RAM and Leveraging Parallelism to Achieve Obliviousness.

• Authors : Dachman-Soled, Dana; Liu, Chang; Papamanthou, Charalampos

Subjects: PARALLEL programming; COMMUNICATION patterns; BIG dataASSOCIATION for Computing Machinery

• Source: Journal of Cryptology; Jul2019, Vol. 32 Issue 3, p941-972, 32p

Record details

Is Multicore Hardware for General-Purpose Parallel Processing Broken?

• Authors : Vishkin, Uzi

Subjects: PARALLEL processing; COMPUTER systems; TECHNOLOGICAL progress

• Source: Communications of the ACM; Apr2014, Vol. 57 Issue 4, p35-39, 5p, 1 Color Photograph

Record details

NEW PRODUCTS.

Subjects: COMPUTERS; BOOKS -- Reviews; PARALLEL processing

• Source: Linux Journal. Sep2007, Issue 161, p48-49. 2p. 4 Black and White Photographs.

Record details

University researchers tout "desktop supercomputer" chip.

• Authors : Taylor, Colleen

Subjects: *PARALLEL processing; *COMPUTERS; CONTESTSMARYLANDA. James Clark School of Engineering...

• Source: Electronic News. 7/2/2007, Vol. 53 Issue 27, p9-9. 1p.

Record details

Using Simple Abstraction to Reinvent Computing for Parallelism.

• Authors : VISHKIN, UZI

Subjects: PARALLEL computers; COMPUTER multitasking; COMPUTER programming

• Source: Communications of the ACM; Jan2011, Vol. 54 Issue 1, p75-85, 11p, 5 Diagrams, 1 Graph

Record details

Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems.

• Authors : Gurevich, Yuri; Stockmeyer, Larry; Vishkin, Uzi

• Source: Journal of the ACM; Jun1984, Vol. 31 Issue 3, p459-473, 15p

Record details

Biconnectivity approximations and graph carvings.

• Authors : Khuller, Samir; Vishkin, Uzi

• Source: Journal of the ACM; Mar1994, Vol. 41 Issue 2, p214-235, 22p

Record details