En.605.704 Instant

Here is developed content for a graduate-level course titled en.605.704: Foundations of Computer Architecture. This content is structured as a syllabus module followed by a sample lecture outline, designed for a university engineering program (e.g., Johns Hopkins EP).

Slide 3: Pipeline Diagram Example (3 instructions)

Cycle:   1   2   3   4   5   6   7
I1:     IF  ID  EX  MEM WB
I2:         IF  ID  EX  MEM WB
I3:             IF  ID  EX  MEM WB

Timing Anomalies

Problem: Adding a faster CPU actually causes deadline misses due to cache effects.
Solution: Analyze the critical instant and consider cache partitioning. en.605.704

Frequently Asked Questions (FAQ)

Q: Is EN.605.704 offered online or in-person? A: Johns Hopkins Engineering for Professionals is primarily designed for working professionals. Most sections are offered asynchronously online with optional synchronous recitations. On-campus sections at the Homewood or Washington DC centers are rare. Here is developed content for a graduate-level course

Q: How many hours per week? A: Expect 10–15 hours per week, including video lectures, readings (primary literature from NEJM, JAMA, and FDA dockets), and coding assignments. Slide 3: Pipeline Diagram Example (3 instructions) Cycle:

Q: Can I take this course without being in a JHU degree program? A: Yes. Non-degree seeking (NDS) students can register if they meet prerequisites and space is available. However, priority goes to degree-seeking students in the Applied Biomedical Engineering or Regulatory Science master’s programs.

Q: Does this course count toward RAC (Regulatory Affairs Certification) recertification? A: Yes. RAPS (Regulatory Affairs Professionals Society) accepts JHU graduate-level regulatory courses for RAC recertification credits. Typically worth 10–15 CEUs.

2. Uniprocessor Scheduling Algorithms

• Clock-driven scheduling: Time-triggered tables.
• Priority-driven scheduling: Fixed-priority (Rate Monotonic) and Dynamic-priority (EDF).
• Schedulability tests: Utilization bound test (Liu & Layland) for RM; Demand bound function for EDF.
• Practical limitations: Critical instant, context-switch overhead.