- 博客(0)
- 资源 (7)
- 收藏
- 关注
Early-Release Fair Scheduling
We present a variant of Pfair scheduling, which we call early-release fair (ERfair) scheduling. Like c onventional Pfair sche duling, ERfair sche duling algorithms can be
applie dto optimally sche dule periodic tasks on a multiprocessor system in polynomial time. However, ERfair
sche duling diers from Pfair scheduling in that it is work conserving. As a result, average job response times may be much lower under ERfair scheduling than under Pfair
sche duling, particularly in lightly-loaded systems. In addition, runtime costs ar e lower under ERfair scheduling.
2011-03-04
Tutorial: Design and Validation of Protocols
It can be remarkably hard to design a good communications protocol, much harder
even than it is to write a normal sequential program. Unfortunately, when the design of a
new protocol is complete, we usually have little trouble convincing ourselves that it is
trivially correct. It can be a unreasonably hard to prove those facts formally and to convince
also others. Faced with that dilemma, a designer usually decides to trust his or her
instincts and forgo the formal proofs. The subtle logical flaws in a design thus get a
chance to hide, and inevitably find the worst possible moment in the lifetime of the protocol
to reveal themselves.
Though few will admit it, most people design protocols by trial and error. There is a
known set of trusted protocol standards, whose descriptions are faithfully copied in most
textbooks, but there is little understanding of why some designs are correct and why others
are not. To design and to analyze protocols you need tools. Until recently the right
tools were simply not generally available. But that has changed. In this tutorial we introduce
a state-of-the-art tool called SPIN and a specification language called PROMELA,
and we show how these can be used to design reliable protocols.
2010-08-04
An introduction to process calculi
进程代数课程An introduction to process calculi:Calculus of Communicating Systems
(CCS)
Lecture 2 of Modelli Matematici dei Processi
Concorrenti
University of Southampton, UK
2010-06-03
The Objective Caml system Documentation and user's manual
Objective Caml (OCaml) 是Caml编程语言的主要实现,由Xavier Leroy,Jérôme Vouillon,Damien Doligez,Didier Rémy及其他人于1996年创立。OCaml是开放原始码项目。此项目的管理和大部分维护工作交由INRIA。
2010-05-28
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人