Tag - Computation Models
Speakers: Nodari Sitchinava
Speakers: Varunkumar Jayapaul
Speakers: John Iacono
In the standard model of computation often taught in computer science courses one identifies elementary operations and counts them in order to obtain the runtime. However, given the complexity of computing hardware, this measure often does not correlate well with actual observed runtime on a computer; accessing n items sequentially or randomly typically have runtimes that differ by several orders of magnitude. In this talk I will present the cache-oblivious model of computation, a model that was introduced by Prokop in 1999 and is relatively easy to reason with, by modeling the multilevel caches that are a defining feature of the cost of modern computation. After presenting the model, several data structure and algorithms that illustrate design techniques to develop cache-obliviously optimal structures will be presented.
Speakers: Tony Huynh
Today Tony will tell us about Transfinite Ford-Fulkerson on a Finite Network.