Author image not provided
 Asaph Zemach

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article12.57
Citation Count88
Publication count7
Publication years1994-2000
Available for download6
Average downloads per article366.67
Downloads (cumulative)2,200
Downloads (12 Months)88
Downloads (6 Weeks)2
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


7 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 7 of 7
Sort by:

1
November 2000 Journal of Parallel and Distributed Computing: Volume 60 Issue 11, Nov. 2000
Publisher: Academic Press, Inc.
Bibliometrics:
Citation Count: 23

We enhance the well-established software combining synchronization technique to create combining funnels. Previous software combining methods used a statically assigned tree whose depth was logarithmic in the total number of processors in the system. On shared memory multiprocessors the new method allows one to dynamically build combining trees with depth ...

2 published by ACM
May 1999 PODC '99: Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Publisher: ACM
Bibliometrics:
Citation Count: 6
Downloads (6 Weeks): 0,   Downloads (12 Months): 17,   Downloads (Overall): 670

Full text available: PDFPDF

3 published by ACM
June 1998 PODC '98: Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Publisher: ACM
Bibliometrics:
Citation Count: 7
Downloads (6 Weeks): 0,   Downloads (12 Months): 11,   Downloads (Overall): 257

Full text available: PDFPDF

4 published by ACM
August 1997 PODC '97: Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Publisher: ACM
Bibliometrics:
Citation Count: 2
Downloads (6 Weeks): 0,   Downloads (12 Months): 17,   Downloads (Overall): 396

Full text available: PDFPDF

5 published by ACM
November 1996 ACM Transactions on Computer Systems (TOCS): Volume 14 Issue 4, Nov. 1996
Publisher: ACM
Bibliometrics:
Citation Count: 30
Downloads (6 Weeks): 2,   Downloads (12 Months): 26,   Downloads (Overall): 588

Full text available: PDFPDF
Shared counters are among the most basic coordination structures in multiprocessor conputation, with applications ranging from barrier synchronization to concurrent-data-structure design. This article introduces diffracting trees, novel data structures for share counting and load balancing in a distributed/parallel environment. Empirical evidence, collected on a simulated distributed shared-memory machine and several ...
Keywords: index distribution, wait free, contention, counting networks, lock free

6 published by ACM
June 1996 SPAA '96: Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Publisher: ACM
Bibliometrics:
Citation Count: 8
Downloads (6 Weeks): 0,   Downloads (12 Months): 7,   Downloads (Overall): 131

Full text available: PDFPDF

7 published by ACM
August 1994 SPAA '94: Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Publisher: ACM
Bibliometrics:
Citation Count: 12
Downloads (6 Weeks): 0,   Downloads (12 Months): 10,   Downloads (Overall): 158

Full text available: PDFPDF
Shared counters are among the most basic coordination structures in multiprocessor computation, with applications ranging from barrier synchronization to dynamic load balancing. Introduced in this paper are diffracting trees , novel distributed-parallel data structures for shared counting. Diffracting trees combine a randomized coordination method together with a combinatorial data structure, ...



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us