Computing Science Graduate Fellowship

Terms of Reference

  1. The School of Computing Science Graduate Fellowship (CSGF) is a one-term award valued at approximately $6,000 for a Master's student and $6,000 for a PhD student.
  2. This fellowship is available on a matching basis: half of the fellowship will come from the School of Computing Science and the other half, in the form of a research assistantship, from the student’s supervisor.
  3. To be eligible to hold a CSGF, a student must:
    1. be registered as a full-time, regular (not "on-leave" or "part-time") student and must normally have a first-class (≥ 3.50) grade point average
    2. not be carrying a deferred grade at the time of application
    3. have academic merit including grades, research ability, and progress
  4. Demonstrated research ability may outweigh the grade point average criterion. Research ability will include reviewing the student’s referee letters indicating strong support, research publications and positive Computing Science progress reports.
  5. Recipients of a CSGF may accept scholarship support from other sources, but the total value of the support (external and internal scholarship and research assistantship) may not exceed $50,000 per year. In any given term, a student may not hold more than one award from the following group of internal awards — CSGF, SFU Graduate Fellowship, Faculty of Applied Sciences Dean’s Fund Graduate Fellowship (FAS-GF), and President’s PhD Research Stipend.
  6. Recipients of a CSGF may receive no other employment income except as a part-time research assistant or intern where the work involved constitutes the recipient’s actual thesis (or equivalent) research project in the term that the CSGF is held.
  7. Students will normally be eligible to receive CSGF support only during the first 9 terms of a Master's program and during the first 15 terms of a PhD program. Preference will be given to students who are in their first 5 terms for Master’s and first 12 terms for PhD For student transferred from a Masters program to a PhD program, the term of transfer will be regarded as the first term in his/her PhD program in the above calculation.
  8. Applicants may apply for and be recommended for one, two or three terms of support in each academic year (commencing in the Fall term).
  9. The completed application and all supporting documents must be received by the department of enrolment.
  10. Awards are made by the Senate Graduate Awards Adjudication Committee on the recommendation of the School of Computing Science Graduate Committee.

Revised: February 2012

Download

Other Computing Science Scholarships

Search the Graduate Studies website

Print

Defences and Events

  • Adhi Susilo PhD Education Thesis Examination
    10:00 AM - 1:00 PM
    May 30, 2013
    No Description
  • Haiyang Wang, Phd defence, Comp Sci
    11:30 AM - 1:30 PM
    May 30, 2013
    Ph.D. Thesis DEFENSE HAIYANG WANG Master from Tongji University, CHINA 2005 Thursday May 30th, 2013 11:30 a.m. TASC1 9204 West FROM PEERS TO CLOUDS: DISTRIBUTED RESOURCES FOR CONTENT DELIVERY AND USER COLLABORATION In this thesis, we tackle the problem of content delivery and user collaboration with emerging Internet technologies. Our investigation starts from peer-to-peer (P2P) sharing with social relations to contemporary cloud computing with flexible resource provisioning. We seek to leverage distributed resources for efficient sharing and collaboration, which leads to a hybrid system design that seamlessly bridges users' local resources to public datacenters. We first explore social-network-based optimizations in peer-to-peer content delivery. We give solid evidences that long-term social relations can be found and applied to enhance the sharing efficiency in peer-to-peer networks, and present practical implementation strategies for the popular BitTorrent system. We then investigate the performance of cloud-based file synchronization applications and identify the bottlenecks in their system design, in particular, the task interferences. We propose an interference-aware provisioning algorithm, which effectively mitigates the problem. We further examine the users' interactions in state-of-the-art cloud-based distributed interactive applications. We find that, despite the benefit in terms of cost savings and better scalability, the cloud-based deployment greatly increases the users' interaction latency. We demonstrate that a smart assignment algorithms for virtual machines can remarkably reduce such latency. Finally, we present a real-world system design that effectively bridges users' local resources to enterprise cloud platforms. Our measurements as well as system analysis indicate that it serves as a complement of great potentials to enterprise cloud services. Ph.D. Examining Committee: Dr. Jiangchuan Liu, Senior Supervisor Dr. Mohamed Hefeeda, Supervisor Dr. Qianping Gu, Internal Examiner Dr. Kui Ren, External Examiner Dr. Steven Pearce, Chair
  • PhD Defence, Haiyang Wang, Comp Sci
    11:30 AM - 1:30 PM
    May 30, 2013
    Ph.D. Thesis DEFENSE HAIYANG WANG Master from Tongji University, CHINA 2005 Thursday May 30th, 2013 11:30 a.m. TASC1 9204 West FROM PEERS TO CLOUDS: DISTRIBUTED RESOURCES FOR CONTENT DELIVERY AND USER COLLABORATION In this thesis, we tackle the problem of content delivery and user collaboration with emerging Internet technologies. Our investigation starts from peer-to-peer (P2P) sharing with social relations to contemporary cloud computing with flexible resource provisioning. We seek to leverage distributed resources for efficient sharing and collaboration, which leads to a hybrid system design that seamlessly bridges users' local resources to public datacenters. We first explore social-network-based optimizations in peer-to-peer content delivery. We give solid evidences that long-term social relations can be found and applied to enhance the sharing efficiency in peer-to-peer networks, and present practical implementation strategies for the popular BitTorrent system. We then investigate the performance of cloud-based file synchronization applications and identify the bottlenecks in their system design, in particular, the task interferences. We propose an interference-aware provisioning algorithm, which effectively mitigates the problem. We further examine the users' interactions in state-of-the-art cloud-based distributed interactive applications. We find that, despite the benefit in terms of cost savings and better scalability, the cloud-based deployment greatly increases the users' interaction latency. We demonstrate that a smart assignment algorithms for virtual machines can remarkably reduce such latency. Finally, we present a real-world system design that effectively bridges users' local resources to enterprise cloud platforms. Our measurements as well as system analysis indicate that it serves as a complement of great potentials to enterprise cloud services. Ph.D. Examining Committee: Dr. Jiangchuan Liu, Senior Supervisor Dr. Mohamed Hefeeda, Supervisor Dr. Qianping Gu, Internal Examiner Dr. Kui Ren, External Examiner Dr. Steven Pearce, Chair
  • Download .ics