|
Further information: Software engineering Cache algorithms CHS conversion: converting between disk addressing systems Double dabble: Convert binary numbers to BCD Hash Function: convert a large, possibly variable-sized amount of data into a small datum, usually a single integer that may serve as an index into an array Fowler–Noll–Vo hash function: fast with low collision rate Pearson hashing: computes 8 bit value only, optimized for 8 bit computers Zobrist hashing: used in the implementation of transposition tables Unicode Collation Algorithm Xor swap algorithm: swaps the values of two variables without using a buffer Database algorithms Further information: Database Algorithms for Recovery and Isolation Exploiting Semantics (ARIES): transaction recovery Join algorithms Block nested loop Hash join Nested loop join Sort-Merge Join Distributed systems algorithms Further information: Distributed systems Bully algorithm: a method for dynamically selecting a coordinator Byzantine fault tolerance: good fault tolerance. Clock synchronization Berkeley algorithm Cristian's algorithm Intersection algorithm Marzullo's algorithm Detection of Process Termination Dijkstra-Scholten algorithm Huang's algorithm Lamport ordering: a partial ordering of events based on the happened-before relation Mutual exclusion Lamport's Distributed Mutual Exclusion Algorithm Naimi-Trehel's log(n) Algorithm Maekawa's Algorithm Raymond's Algorithm Ricart-Agrawala Algorithm Paxos algorithm: a family of protocols for solving consensus in a network of unreliable processors Snapshot algorithm: record a consistent global state for an asynchronous system Vector clocks: generate a partial ordering of events in a distributed system and detect causality violations Memory allocation and deallocation algorithms Buddy memory allocation: Algorithm to allocate memory such that fragmentation is less. Garbage collectors Boehm garbage collector: Conservative garbage collector Cheney's algorithm: An improvement on the Semi-space collector Generational garbage collector: Fast garbage collectors that segregate memory by age Mark-compact algorithm: a combination of the mark-sweep algorithm and Cheney's copying algorithm Mark and sweep Semi-space collector: An early copying collector Reference counting Operating systems algorithms Further information: Operating systems Banker's algorithm: Algorithm used for deadlock avoidance. Page replacement algorithms: Selecting the victim page under low memory conditions. Adaptive replacement cache: better performance than LRU Clock with Adaptive Replacement (CAR): is a page replacement algorithm that has performance comparable to Adaptive replacement cache Networking Further information: Network scheduler Karn's Algorithm: addresses the problem of getting accurate estimates of the round-trip time for messages when using TCP Luleå algorithm: a technique for storing and searching internet routing tables efficiently Network congestion Exponential backoff Nagle's algorithm: improve the efficiency of TCP/IP networks by coalescing packets Truncated binary exponential backoff Process synchronization Further information: Process synchronization Further information: Process scheduler Dekker's algorithm Lamport's Bakery algorithm Peterson's algorithm Scheduling Further information: Scheduling (computing) Earliest deadline first scheduling Fair-share scheduling Least slack time scheduling List scheduling Multi level feedback queue Rate-monotonic scheduling Round-robin scheduling Shortest job next Shortest remaining time Top-nodes algorithm: resource calendar management Disk scheduling Further information: Disk scheduling Elevator algorithm: Disk scheduling algorithm that works like an elevator. Shortest seek first: Disk scheduling algorithm to reduce seek time. |
About us|Jobs|Help|Disclaimer|Advertising services|Contact us|Sign in|Website map|Search|
GMT+8, 2014-3-16 11:16 , Processed in 0.076070 second(s), 17 queries .
