Software engineering
From codeuu,source code
Contents |
[edit] Distributed systems algorithms
- Lamport ordering
- Snapshot algorithm
- Vector clocks
- Marzullo's algorithm
- intersection algorithm
- Byzantine fault tolerance
[edit] Memory Allocation and deallocation algorithms
- Boehm garbage collector
- Buddy memory allocation
- Generational garbage collector
- Mark and sweep
- Reference counting
[edit] Operating systems algorithms
[edit] Disk scheduling algorithms
[edit] Process synchronisation algorithms
[edit] Scheduling algorithms
- Rate-monotonic scheduling
- Earliest deadline first scheduling
- Fair-share scheduling
- Round-robin scheduling
- Multi level feedback queue
- shortest job next
- shortest remaining time
- Least slack time scheduling
- List scheduling
- Atropos scheduler
- CFQ
- Critical path method
- Deadline-monotonic scheduling
- Deficit round robin
- Dynamic priority scheduling
- Event Chain Diagrams
- Event chain methodology
- FIFO
- FINO
- FSCAN
- Fair queuing
- Foreground-background
- Gang scheduling
- Generalized Processor Sharing
- Highest response ratio next
- Interval scheduling
- LIFO
- LIFO order
- LOOK algorithm
- Lottery Scheduling
- Max-min fairness
- Maximum throughput scheduling
- Modified due date scheduling heuristic
- Multilevel feedback queue
- Multilevel queue
- N-Step-SCAN
- O(1) scheduler
- Process Contention Scope
- Processor affinity
- Proportional Share Scheduling
- Proportionally fair
- Scheduling starvation
- Two-level scheduling
- Weighted fair queuing
- Weighted round robin
- Windows NT Processor scheduling
[edit] Electronics and hardware algorithms
| Algorithms Categories | |||
