Rida
A. Bazzi
Associate
Professor
PhD, Georgia Institute of Technology, 1994
bazzi*asu°edu
(480)
965-2796 (phone)
(480)
965-2751 (fax)
Teaching
I teach a variety of courses.
Students can access course material through blackboard. Recently taught courses:
Programming Languages (CSE340)
Computer Networks (CSE 434)
The ASU Experience (ASU 101)
Theory of Computation (CSE 555)
Programming Languages (CSE 340)
Compiler Construction (CSE440/598)
Programming Languages (CSE 340)
Theory of Computation (CSE 555)
Conferences
Research
My
general area of research is distributed computing with special interests in
fault tolerance and security and reliability.
One area of particular interest is dynamic software updates (DSU). Our DSU efforts can be found at the Dynamic Updates of Software Systems (DUOSS) project pages.
A list of my publications
follows. This is not a complete list of publications. For papers that appeared
in both conferences and journals, I omit the conference version in most cases.
The color coded symbol after each listing indicates the general area of the
paper
- Fault tolerance/Reliability (FT)
- Quorums (Q)
- Security (S)
- Knowledge (K)
Journal Papers
- Rida A. Bazzi,Young-ri Choi, and Mohamed G. Gouda: Hop
chains: Secure routing and the establishment of distinct identities.
Theoretical Computer Science Vol. 410 , Issue 6-7,
pp.
467-480 (February 2009). S
- Rida A. Bazzi, Goran Konjevod: On
the establishment of distinct identities in overlay networks. Distributed
Computing. Distributed Computing 19(4): 267-287 (2007). S
- Rida A. Bazzi and Gil Neiger. Simplifying
Fault Tolerance: Providing the Abstraction of Crash Failures, Journal of the ACM, Vol.48, No. 3, pp.
499-554, ACM, May 2001. FT
- Rida A. Bazzi. Access
cost for asynchronous Byzantine quorum systems. Distributed
Computing,, Vol. 14, No. 1, pp 41-48,
ACM-Springer, January 2001 (Conference
version). FT Q
- Rida A. Bazzi. Planar
Quorums. Theoretical
Computer Science,
Vol. 243, Nos. 1-2, pp. 243--268, Elsevier, July 2000. FT Q
- Rida A. Bazzi. Synchronous
Byzantine Quorum Systems. Distributed Computing, Vol. 13, No.
1, pp. 45--52 ACM-Springer, January 2000. FT Q
- Rida A. Bazzi, Gil Neiger and Gary
L. Peterson. On
the use of registers
in achieving wait-free Consensus. Distributed
Computing, Vol. 10, No. 3, pp. 117-128, Springer, 1997. FT
- Gil Neiger
and Rida A. Bazzi. Using
knowledge to optimally achieve coordination in distributed systems. Theoretical
Computer Science, 220, pp.
31-65, Elsevier, 1999. K
- Rida A. Bazzi and Gil Neiger. The Complexity of almost optimal coordination. Algorithmica, Vol. 17, pp. 308-321, Springer,
1997. K
Book Chapter
- Rida
A. Bazzi and Feras Karablieh. Development of reliable commercial
applications in large
and open distributed systems. In Handbook of E-business,
Paul B. Lowry, J. Owen Cherrington, and Ronald
R. Watson eds., CRC Press 2002. FT S
Refereed Conference
Papers
- Kristis Makris and Rida
A. Bazzi: Immediate Multi-Threaded
Dynamic Software Updates Using Stack Reconstruction. USENIX Annual
Technical Conference, 2009.FT
- Amitanand S. Aiyer,
Lorenzo Alvisi, Rida A. Bazzi,
and Allen Clement: Matrix
Signatures: From MACs to Digital Signatures in Distributed Systems.
International
Symposium on Distributed Computing (DISC) 2008: 16-31 S
- Amitanand S. Aiyer,
Lorenzo Alvisi, Rida A.
Bazzi: Bounded
Wait-Free Implementation of Optimally Resilient Byzantine Storage Without
(Unproven) Cryptographic Assumptions. International Symposium on
Distributed Computing (DISC) 2007: 7-19 FT S
- Rida A. Bazzi, Yin Ding: Bounded
Wait-Free f-Resilient Atomic Byzantine Data Storage Systems for an
Unbounded Number of Clients.. International Symposium on Distributed Computing (DISC)
2006: 299-313. FT S
- Rida A. Bazzi, Young-ri Choi, Mohamed G. Gouda: Hop
Chains: Secure Routing and the Establishment of Distinct Identities.
International Conference On Principles Of Distributed Systems (OPODIS)
2006: 365-379 Award Paper S
- Amitanand S. Aiyer,
Lorenzo Alvisi, Rida A. Bazzi:
Byzantine and Multi-writer K-Quorums. International Symposium on
Distributed Computing (DISC) 2006: 443-458 FT Q
- Rida A. Bazzi, Goran Konjevod: On the establishment of distinct identities
in overlay networks. ACM Symposium on Principles of Distributed Computing
(PODC) 2005: 312-320 Award Paper S
- Amitanand S. Aiyer,
Lorenzo Alvisi, Rida A.
Bazzi: On the Availability of Non-strict Quorum
Systems. International Symposium on Distributed Computing (DISC)
2005: 48-62. FT Q
- Rida A. Bazzi, Goran Konjevod :
Efficient Verification for Provably Secure Storage and Secret Sharing in
Systems Where Half the Servers Are Faulty. International Symposium on
Distributed Computing (DISC) 2004: 420-434. FT S
- Rida A. Bazzi, Yin Ding:
Non-skipping Timestamps for Byzantine Data Storage Systems. International Symposium
on Distributed Computing (DISC) 2004:
405-419. FT
- Rida A. Bazzi, K. Selcuk Candan, Raphael Badin, and
Aziz Fajri. Provably Secure Data Hiding and Tamper Resistance for a
Simple Loop Program. In Proceedings of SPIE Aerosense
Conference, Orlando, Florida, April 2003. S
- Feras Karablieh,
Rida A. Bazzi. Heterogeneous Checkpointing for Multithreaded Applications. In
Proceedings of the 21st Symposium on Reliable Distributed Systems (SRDS),
Japan 2002: 140-149. FT
- Feras Karablieh,
Rida A. Bazzi, and Margaret Hicks.
Compiler-Assisted Heterogeneous Checkpointing.
In Proceedings of the 20th Symposium on Reliable Distributed Systems (SRDS),
New Orleans, Louisiana, 2001. FT
Non-refereed publications
- Rida
A. Bazzi, Yin Ding: Brief announcement:
wait-free implementation of multiple-writers/multiple-readers atomic
byzantine data storage systems. PODC 2005: 353. FT
- Ping
Lin, K. Selçuk Candan,
Rida A. Bazzi, Zhichao
Liu: Hiding Data and Code Security for Application Hosting Infrastructure.
ISI 2003: 388. S
- Rida
A. Bazzi, Uday Deshraj, and Feras Karablieh. Compiler-Generated Primary/Backup Pairs in
Heterogeneous System (2-page Abstract) International Conference on
Dependable Systems and Networks, Goteborg, Sweden, 2001. FT
Technical Report
Current Students
- Jun
Shen (PhD, dynamic software update)
- Mohsen Zohrevandi (PhD, Scientific workflow updates)
- Bryan Topp (Honors)
Past Students
PhD
- Kristis Makris (2009, Whole program dynamic software
updating)
- Yin
Ding (2008, Byzantine fault-tolerant storage system )
- Feras
Karablieh (2005, Compiler assisted
application-level fault tolerance in distributed systems)
MS
- Preetika
Tgayi (2011, Client-driven dynamic schema updates)
- Joseph Stith (2010,Visualization of event
sequences for maximizing overall equipment efficiency)
- Venkatesh Mandalapa
(2009, Schema evolution analysis tool suite (SEATS): understanding schema
evolution in web information relational database systems)
- Rajkumar Ponnusamy
(2009, Optimization of derived table creation framework for online
non-blocking relational schema changes)
- Scott
Turley (2005, Heterogeneous checkpointing for real-time systems :
incremental checkpointing in the application )
- Jimi Shah (2004, Polynomial time
replica placement in content delivery networks)
- Amit Umesh
Shanbhag (2003, Portable cross-version
checkpointing and recovery for dynamic software updates )
- Hema Krishnamurthy (2001,
Access control and delegation in concurrent systems : a formal approach )
- Margaret
Hicks (2001, A source-to-source compiler supporting portable checkpoints in
heterogeneous systems )
- Uday Deshraj
(2000, Automatic and transparent fault detection and recovery framework )
- Amit Jindal (1999, Quorums : replication of data in distributed
systems )
Honor Theses
- Maya Muraldihar (2010, A study of the schema evolution of
wordpress)
- Randy Compton (2009, Safety checking of dynamic program
updates)