Rafi Shan Turas, Master’s candidate
David R. Cheriton School of Computer Science
Aaron Moss, PhD candidate
David R. Cheriton School of Computer Science
Vijay Ganesh, ECE
University of Waterloo
Mustafa Korkmaz, PhD candidate
David R. Cheriton School of Computer Science
Data centers consume significant amounts of energy and consumption is growing each year. Alongside efforts in the hardware domain, there are some mechanisms in the software domain to reduce energy consumption. One of these mechanisms is dynamic voltage and frequency scaling (DVFS) and modern servers which are equipped with multi-core CPUs.
Donald E. Knuth
Professor Emeritus of The Art of Computer Programming
Stanford University
Abstract: The speaker will answer any question on any subject.
Andrew Beltaos / Amenda Chow
University of Waterloo / York University
Teaching via analogies builds upon students' existing knowledge. New concepts that are taught only within the context of mathematics may seem foreign to students at first glance, but if students have already learned analogous concepts elsewhere in life, as educators, we can make use of their existing framework to strengthen their learning.
Yuwei Jiao, Master’s candidate
David R. Cheriton School of Computer Science
Bushra Aloraini, PhD candidate
David R. Cheriton School of Computer Science
Amine Mhedhbi, PhD candidate
David R. Cheriton School of Computer Science
We study the problem of optimizing subgraph queries (SQs) using the new worst-case optimal (WCO) join plans in Selinger-style cost-based optimizers. WCO plans evaluate SQs by matching one query vertex at a time using multiway intersections. The core problem in optimizing WCO plans is to pick an ordering of the query vertices to match.
We make two contributions:
Jeff Avery, PhD candidate
David R. Cheriton School of Computer Science