![[Search]](/static/images/search.gif){kind=small}
![[A-Z Index]](/static/images/az.gif){kind=small}
![[Contact]](/static/images/contact.gif){kind=small}
![[University of Cambridge]](/static/images/identifier2.gif){kind=small}
![[Talks.cam]](/static/images/talkslogosmall.gif)
Tuesday 16 February 2010, 13:00-13:45
Zero-copy programming
- đ¤ Speaker: Stephen Kell (University of Cambridge)
- đ Date & Time: Tuesday 16 February 2010, 13:00 - 13:45
- đ Venue: Computer Laboratory, William Gates Building, Room FW11
Abstract
In this “crazy idea” talklet, I will begin by claiming that memory remains a scarce resource, in contrast to the relative plenty of CPU , disk space etc. on modern machines. Many programs contain redundant copies of information, which might be collapsible by OS-level mechanisms (shared memory, memory-mapped I/O). Sharing-recovery approaches (like Satori) rely on copies being bitwise-verbatim, whereas I estimate that more copies are found in somewhat transcoded form, where there is some small computational distance between different copies’ representations. I will describe a few examples of such programs, a few ideas that might help save memory in these cases, and a few foreseeable challenges.
Series This talk is part of the Computer Laboratory NetOS Group Talklets series.
Included in Lists
- All Talks (aka the CURE list)
- bld31
- Cambridge talks
- Computer Laboratory NetOS Group Talklets
- Computer Laboratory, William Gates Building, Room FW11
- Department of Computer Science and Technology talks and seminars
- Interested Talks
- School of Technology
- Trust & Technology Initiative - interesting events
- yk449
Note: Ex-directory lists are not shown.