Search Results

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

Oblivious Network RAM and Leveraging Parallelism to Achieve Obliviousness.

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

• Source: Advances in Cryptology - ASIACRYPT 2015: 21st International Conference on the Theory & Application of Cryptology & Information Security, Auckland, New Zealand, November 29 - December 3, 2015,

Record details

Towards a First Vertical Prototyping of an Extremely Fine-Grained Parallel Programming Approach.

• Authors : Naishlos, Dorit; Nuzman, Joseph; Chau-Wen Tseng

Subjects: SIMULTANEOUS multithreading processors; PARALLEL programming

• Source: Theory of Computing Systems. Sep/Oct2003, Vol. 36 Issue 5, p521. 32p.

Record details

Deterministic Resource Discovery in Distributed Networks.

• Authors : Kutten, Shay; Peleg, David; Vishkin, Uzi

Subjects: GRAPH theory; COMMUNICATION models

• Source: Theory of Computing Systems. Sep/Oct2003, Vol. 36 Issue 5, p479. 17p.

Record details

Thermal Management of a Many-Core Processor under Fine-Grained Parallelism.

• Authors : Keceli, Fuat; Moreshet, Tali; Vishkin, Uzi

• Source: Euro-Par 2011: Parallel Processing Workshops (9783642297366); 2012, p249-259, 11p

Record details

HPPC 2009 Panel: Are Many-Core Computer Vendors on Track?

• Authors : Forsell, Martti; Hofstee, Peter; Jerraya, Ahmed

• Source: Euro-par 2009 - Parallel Processing Workshops; 2010, p9-15, 7p

Record details

Resource-Aware Compiler Prefetching for Fine-Grained Many-Cores.

• Authors : Caragea, George; Tzannes, Alexandros; Keceli, Fuat

Subjects: PARALLELIZING compilers; MICROPROCESSOR programming; COMPUTER algorithms

• Source: International Journal of Parallel Programming; Oct2011, Vol. 39 Issue 5, p615-638, 24p, 4 Diagrams, 1 Chart, 5 Graphs

Record details

Finding the maximum, merging and sorting in a parallel computation model.

• Authors : Goos, G.; Hartmanis, J.; Brauer, W.

• Source: Conpar 81; 1981, p314-327, 14p

Record details

On finding lowest common ancestors: Simplification and parallelization.

• Authors : Goos, G.; Hartmanis, J.; Barstow, D.

• Source: VLSI Algorithms & Architectures; 1988, p111-123, 13p

Record details

Optimal parallel algorithms for expression tree evaluation and list ranking.

• Authors : Goos, G.; Hartmanis, J.; Barstow, D.

• Source: VLSI Algorithms & Architectures; 1988, p91-100, 10p

Record details