A discreet, fault-tolerant, and scalable software architectural style for internet-sized networks

Proceedings - International Conference on Software Engineering

Volumn , Issue , 2007, Pages 83-84

  Brun, Yuriy ^a  

^a University of Southern California ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; CRYSTAL GROWTH; FAULT TOLERANCE; FAULT TOLERANT COMPUTER SYSTEMS; LARGE SCALE SYSTEMS; LEARNING ALGORITHMS; SCALABILITY; SOFTWARE ARCHITECTURE;

PROBLEM SIZE; SOFTWARE ARCHITECTURAL STYLE;

TELECOMMUNICATION NETWORKS;

EID: 34548802394     PISSN: 02705257     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICSECOMPANION.2007.12     Document Type: Conference Paper

References (4)

1. Y. Brun. Arithmetic computation in the tile assembly model: Addition and multiplication. Theoretical Computer Science, 10.1016/j.tcs.2006.10.025, 2006.
2. D. E. Perry and A. L. Wolf. Foundations for the study of software architecture. ACM SIGSOFT Software Engineering Notes, 17(4):40-52, 1992.
3. M. Sipser. Introduction to the Theory of Computation. PWS Publishing Company, 1997.
4. E. Winfree. Simulations of computing by self-assembly of DNA. Technical Report CS-TR: 1998:22, Caltech, 1998.