On November 2nd, we’re going to try something we’ve never done before.
What happens when we order 600Krispy Kreme donuts and attempt to consume them all in one day. “But that’s not possible!” you exclaim! That’s right, so we’re going to enlist your aid in helping us, if you don’t mind.
For the paltry sum of [amount to be announced once our math whizzes have finished deliberating], you’ll be helping us rid the campus of donuts, the likes of which UBC has never seen before. And also, your generously given coin will help Your Student Society arrange bigger and more lavish things for you.
It would be a shame if the engineers beat you to it. So come out next Wednesday… For great justice!
FSMLabs produces RTLinux, the popular real-time operating system. Dr. Yodaiken is in Vancouver specifically to announce the formal opening of the company’s newly-established Vancouver office.
Modular programming is difficult in a real-time environment efficiency is critical and where interactions that change timing can cause hidden dependencies. RTLinux decouples real-time from non-real-time and provides the programmer some methods of separating programs into simpler components and the first part of this talk will cover the interfacing of real-time and non-real-time modules and connecting real-time software to networked services. The second part will look at modularity within real- time components particularly on limiting the global timing effects of synchronization.
If you are interested in meeting with Victor during his visit, please contact Hermie Lam [email protected]
Come join us after class on Friday, Oct. 14 at the first CSSS Licensed BBQ of the year! The event will be taking place in the student lounge area (outside the Reboot Cafe) of the new wing, and the BBQ will be just outside it, between the old wing and the new wing.
Time: 4:00 - 8:00 p.m. We’ll be starting the BBQ’s up at 4:00 p.m. and the licenced portion of the event will start shortly after 4:00 p.m. as well.
Please note that valid picture ID is required for entrance to the licensed area (the outdoor BBQ will be open to everyone). And if you’re going to join us for the fun, remember to plan a safe trip home (use your UPass!).
Hope to see you at the there!
When:
Friday, October 14, 2005 - 16:00 to 20:00
Where:
CS/ICICS Building in the new wing, Student Lounge (outside the Reboot Cafe)
It is often preferable to build a storage service out of a collection of individual components rather than out of a single monolithic server. The reasons for preferring such a structure are increased fault-tolerance, scalability, and economics. However, the distributed nature of the system can make it complex to design, difficult to implement, and nearly impossible to test making the whole enterprise a daunting one. One of the ways of reducing the complexity of distributed storage systems is to first design a set of simple abstractions and services that can then be composed easily to provide the required functionality. The talk will illustrate examples of this technique with reference to some systems – Petal ‘96, Frangipani ‘97, Boxwood ‘04, and Eclipse ‘05– on which I have worked. These systems demonstrate that it is feasible to build complex storage systems using a set of building blocks that are easy to design, implement, and test.
Byron Cook is a researcher at Microsoft’s research lab at Cambridge University:
In this talk I will discuss Terminator, the first known automatic program termination prover to support large programs with arbitrarily nested loops or recursive functions, and imperative features such as references, functions with side-effects, and function pointers.
Terminator is based on a newly discovered method of counterexample-guided abstraction refinement for program termination proofs. Additionally, to increase the proof power, Terminator computes inductive invariants of the program when checking the lemmas that imply termination. The talk will close with results from recent experiments with Terminator on dispatch routines from Windows device drivers. This is joint work with Andreas Podelski and Andrey Rybalchenko.
FSMLabs produces RTLinux, the popular real-time operating system. Dr. Yodaiken is in Vancouver specifically to announce the formal opening of the company’s newly-established Vancouver office.
It is often preferable to build a storage service out of a collection of individual components rather than out of a single monolithic server. The reasons for preferring such a structure are increased fault-tolerance, scalability, and economics. However, the distributed nature of the system can make it complex to design, difficult to implement, and nearly impossible to test making the whole enterprise a daunting one. One of the ways of reducing the complexity of distributed storage systems is to first design a set of simple abstractions and services that can then be composed easily to provide the required functionality. The talk will illustrate examples of this technique with reference to some systems – Petal ‘96, Frangipani ‘97, Boxwood ‘04, and Eclipse ‘05– on which I have worked. These systems demonstrate that it is feasible to build complex storage systems using a set of building blocks that are easy to design, implement, and test.
Byron Cook is a researcher at Microsoft’s research lab at Cambridge University: