Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
|
 |
Compiling PLAN to SNAP
| Book Series | Lecture Notes in Computer Science |
| Publisher | Springer Berlin / Heidelberg |
| ISSN | 0302-9743 (Print) 1611-3349 (Online) |
| Volume | Volume 2207/2001 |
| Book | Active Networks |
| DOI | 10.1007/3-540-45451-9 |
| Copyright | 2001 |
| ISBN | 978-3-540-42678-3 |
| DOI | 10.1007/3-540-45451-9_9 |
| Pages | 134-151 |
| Subject Collection | Computer Science |
| SpringerLink Date | Monday, January 01, 2001 |
| |
|
Michael Hicks7 , Jonathan T. Moore8 and Scott Nettles9 
| (7) |
Computer Science Department, Cornell University, USA |
| (8) |
Computer and Information Science Department, University of Pennsylvania, USA |
| (9) |
Electrical and Computer Engineering Department, The University of Texas at Austin, USA |
Abstract
PLAN (Packet Language for Active Networks) [3] is a highly flexible and usable active packet language, whereas SNAP (Safe and Nimble Active Packets) [12] offers significant resource usage safety and achieves much higher performance compared to PLAN, but at the cost of flexibility
and usability. Ideally, we would like to combine the good properties of PLAN with those of SNAP. We have achieved this end
by developing a compiler that translates PLANi nto SNAP. The compiler allows us to achieve the flexibility and usability of
PLAN, but with the safety and efficiency of SNAP. In this paper, we describe both languages, highlighting the features that
require special compilation techniques. We then present the details of our compiler and experimental results to evaluate our
compiler with respect to code size.
This work was supported by the NSF under contracts ANI 00-82386 and ANI 98-13875.
Fulltext Preview (Small, Large)
 References secured to subscribers.
|
|
|
|
|
|