ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
Testing for termination of asynchronous parallel computations
Full text PdfPdf (657 KB)
Source ACM Southeast Regional Conference archive
Proceedings of the 36th annual Southeast regional conference table of contents
Pages: 201 - 206  
Year of Publication: 1998
ISBN:1-58113-030-9
Authors
Nabeel I. Al-Fayoumi  Rm. 301 CSE, P.O. Box 116120, CISE Department, University of Florida, Gainesville, FL
Eric N. Hanson  Rm. 301 CSE, P.O. Box 116120, CISE Department, University of Florida, Gainesville, FL
Sponsor
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 3,   Citation Count: 0
Additional Information:

references   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/275295.275359
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
N. AI-Fayoumi and Eric Hanson. A solution to the parallel trigger termination problem. Technical Report TR96-009, University of Florida, CiSE Dept., February 1996. http:// ww.cis .ufl .edu/cis/tech-reports/.
 
2
D. J. Dewitt , S. Ghandeharizadeh , D. A. Schneider , A. Bricker , H. -I. Hsiao , R. Rasmussen, The Gamma Database Machine Project, IEEE Transactions on Knowledge and Data Engineering, v.2 n.1, p.44-62, March 1990  [doi>10.1109/69.50905]
 
3
E. W. Dijkstra, W.H. Seijen, and A. J. M. V. Gastexen. Derivation of a termination detection algorithm for a distributed computation. Informarion processing letters, pages 16-5:217-219, 1983.
4
Michael G. Norman , Thomas Zurek , Peter Thanisch, Much ado about shared-nothing, ACM SIGMOD Record, v.25 n.3, p.16-21, Sept. 1996  [doi>10.1145/234889.234892]
 
5
K. Rokusawa, N. Ichiyoshi, aud T. Chil~ymna~ An eff~ent algorithm for distributed processing sy~. In Proceedings o.f the 1988 Intervmtional conference on parallel processing, 1988.
 
6
M. Stonebraker. The case for shared nothing. IEEE 2~a~~~ On Knowledge and Data Engineering, March 1986.
 
7
Andrew Witkowski , Felipe Cariño , Pekka Kostamaa, NCR 3700 - The Next-Generation Industrial Database Computer, Proceedings of the 19th International Conference on Very Large Data Bases, p.230-243, August 24-27, 1993

INDEX TERMS

Primary Classification:
  F. Theory of Computation
  F.1 COMPUTATION BY ABSTRACT DEVICES
      F.1.2 Modes of Computation
          Subjects: Parallelism and concurrency

Additional Classification:
  C. Computer Systems Organization
  C.1 PROCESSOR ARCHITECTURES


General Terms:
Algorithms, Experimentation, Performance, Theory


Keywords:
asynchronous parallel computation, parallel processing, shared-nothing multiprocessors

Collaborative Colleagues:
Nabeel I. Al-Fayoumi: colleagues
Eric N. Hanson: colleagues

Peer to Peer - Readers of this Article have also read:

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

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player