Computer Science Speaking Skills Talk

Monday, April 16, 2018 - 12:00pm to 1:00pm

Location:

Speaker:

We consider a parallel computational model that consists of P processors, each with a fast local ephemeral memory of limited size, and sharing a large persistent memory. The model allows for each processor to fault with bounded probability, and possibly restart. On faulting all processor state and local ephemeral memory is lost, but the persistent memory remains. This model is motivated by upcoming non-volatile memories that are as fast as existing random access memory, are accessible at the granularity of cache lines, and have the capability of surviving power outages. It is further motivated by the observation that in large parallel systems, failure of processors and their caches is not unusual.

Within the model we develop a framework for developing locality efficient parallel algorithms that are resilient to failures. There are several challenges, including the need to recover from failures, the desire to do this in an asynchronous setting (i.e., not blocking other processors when one fails), and the need for synchronization primitives that are robust to failures. We describe approaches to solve these challenges based on breaking computations into what we call capsules, which have certain properties, and developing a work stealing scheduler that functions properly within the context of failures. The scheduler guarantees a time bound of O(W/P_a +D(P/P_a)*ceil(log1/f W)) in expectation, where W and D are the work and depth of the computation (in the absence of failures), P_a is the average number of processors available during the computation, and f â‰¤ 1/2 is the probability that a capsule fails. Within the model and using the proposed methods, we develop efficient algorithms for parallel sorting and other primitives.

Presented in Partial Fulfillment of the CSD Speaking Skills Requirement

For More Information, Contact:

Keywords:

The admissions process for each undergraduate major varies from program to program, but admissions for our main bachelor of science in computer science are handled through Carnegie Mellon's central Office of Undergraduate Admission. Learn more on our Undergraduate Admissions page.

Master's Programs

The Computer Science Department offers a main M.S. in Computer Science, and applications for that program are submitted online by mid-December for fall admission the following year. Other master's programs available to CSD students have their own admissions processes. Learn more about our admissions requirements and processes here.

Doctoral Programs

The Ph.D. in CS program uses the School of Computer Science online application for admissions. Applications are due in December for admittance the following fall. Students cannot begin in the spring. For more on how to apply, visit our Doctoral Admissions page.

The 2017-2018 application period for the Computer Science Department (CSD) at Carnegie Mellon University has closed for positions starting in Fall 2018.

Each year we seek candidates who have demonstrated commitment to excellence and leadership in undergraduate and graduate teaching, research, and/or service toward building an equitable and diverse scholarly environment.

Additional information can be found on our Faculty Hiring page. Please check back in September for the next hiring period for positions starting in Fall 2019.