The student is also exposed to the notion of a faster algorithm and asymptotic complexity through the O, big-Omega and big-Theta notations. In this module, the student will learn about the basics of ...

Important parallel algorithms and data structures will be discussed, including the notion of lock-free data structures. Note that this class lightly touches upon GPU programming; students primarily ...

Students taking the course for COMP_SCI 368 credit will work on labs that utilize advanced parallel programming, data layout, and algorithm decomposition concepts. Students taking the course for ...