The S-DES encryption algorithm takes an 8-bit block of plaintext (examples:
10111101) and a 10-bit key as input and produces an 8-bit block of ciphertext as output.
The S-DES decryption algorithm takes an 8-bit block of ciphertext and the same 10-bit
key used to produce that ciphertext as input and produces the original 8-bit block of
plaintext.
The S-DES encryption algorithm takes an 8-bit block of plaintext (examples:
10111101) and a 10-bit key as input and produces an 8-bit block of ciphertext as output.
The S-DES decryption algorithm takes an 8-bit block of ciphertext and the same 10-bit
key used to produce that ciphertext as input and produces the original 8-bit block of
plaintext.
The S-DES encryption algorithm takes an 8-bit block of plaintext (examples:
10111101) and a 10-bit key as input and produces an 8-bit block of ciphertext as output.
The S-DES decryption algorithm takes an 8-bit block of ciphertext and the same 10-bit
key used to produce that ciphertext as input and produces the original 8-bit block of
plaintext.
The S-DES encryption algorithm takes an 8-bit block of plaintext (examples:
10111101) and a 10-bit key as input and produces an 8-bit block of ciphertext as output.
The S-DES decryption algorithm takes an 8-bit block of ciphertext and the same 10-bit
key used to produce that ciphertext as input and produces the original 8-bit block of
plaintext.
COURSE TITLE Distributed Computing Systems
COURSE CODE COMP 4130
SEMESTER/YEAR OF OFFERING 1st , 09-10
OFFERING PROGRAMME/UNIT Computer Science & Technology
NO. OF CREDITS 3 credits
CONTACT HOURS
4 hours Monday (10:00 – 12 00), Thursday (14:00 – 16 :00)
SYLLABUS PREPARED / REVIEWED BY Dr. Sunny Jeong
AIMS & OBJECTIVES
This course aims to provide an understanding of the principles on with the Internet and other distributed systems are based, their architecture, algorithms and design. This course covers topics of data replication, group communication, distributed file systems, distributed transaction and emerging issues such as grid and clustering computing systems.
LEARNING OUTCOMESStudents will be able to
Identify characteristics of distributed systems and its challenges.
Explain applications of variety of practical distributed systems.
Explain concepts about emerging distributed systems.
Build and maintain effective distributed systems
COURSE CONTENT / DESCRIPTION/WEEKLY SCHEDULE
Week1. INTRODUCTION/ TYPES OF DISTRIBUTED SYSTEMS/Distributed Pervasive Systems
Week2. ARCHITECTURES VERSUS MIDDLEWARE
Week3. The Role of Virtualization in Distributed Systems / Architectures of Virtual Machines
Week4. COMMUNICATION / REMOTE PROCEDURE CALL / Basic RPC Operation / NAMING
Week6. SYNCHRONIZATION / Global Positioning System /A Distributed Algorithm
Week7. CONSISTENCY AND REPLICATION/ REPLICA MANAGEMENT/Midterm Exam
Week8. FAULT TOLERANCE / PROCESS RESILIENCE / RELIABLE GROUP COMMUNICATION
DISTRIBUTED COMMIT / RECOVERY
Week9 Security Management / Secure Group Management / Authorization Management
Week10. DISTRIBUTED OBJECT-BASED SYSTEMS / Globe Distributed Shared Objects
Week11. DISTRIBUTED FILE SYSTEMS /Client-Server Architectures /Cluster-Based Distributed File Systems /Symmetric Architectures
Week12. DISTRIBUTED WEB-BASED SYSTEMS/ Traditional Web-Based Systems /Simple Object Access Protocol
Week13. DISTRIBUTED COORDINATION-BASED SYSTEMS/2 Traditional Architectures
Peer-to-Peer Architectures / Mobility and Coordination /Clustering & Cluding
Week14. Introduction and General Works/Project Check
ASSESSMENT METHODS
2 Quizzes (20%) 1 project (20%) Mid-term exam (20%) Final exam (40%)
TEXTBOOK
Distributed Systems: Principles and Paradigms, 2/e , Tanenbaum & Van Steen,Prentice Hall
REFERENCE / RECOMMENDED READING
By extending the PL compiler program, the students have a better understanding of the compiling process.
By extending and debugging the scanner of the compiler, the students have a better understanding of the syntactic analysis.
By extending and debugging the syntax analysis program of the PL compiler, the students can understand the principle and implementation of syntax analysis, including top-down analysis, error-handling method and symbol table organization.
By extending the semantic analysis and middle language generation, the students can understand the principle of semantic analysis.
