Resilient is a secure, object-oriented, serviceable, real-time software platform for embedded devices. The platform enables developers to debug, profile, and update code running on embedded devices in the field, vastly improving reliability and development productivity. The compactness makes it possible to fit the virtual machine, core libraries, device drivers, TCP/IP networking stack, and user applications in less than 128KB of memory. The Resilient Technology Preview was released last week. It can be downloaded for free for non-commercial use.
Resilient Technology Preview Released
About The Author
Eugenia Loli
Ex-programmer, ex-editor in chief at OSNews.com, now a visual artist/filmmaker.
Follow me on Twitter @EugeniaLoli
“The compactness makes it possible to fit the virtual machine, core libraries, device drivers, TCP/IP networking stack, and user applications in less than 128KB of memory.”
All that in 128K. Now why is present software so fat?
All that in 128K. Now why is present software so fat?
When a word processor takes several CDs, you do have to wonder…
there is something wrong with programming these days… no fault of ours… is it our job to destroy C because it creates bloat (not nearly as much as C++ etc.)
NEW standards.kind of like chinese characters instead concept characters replace words and functions
jat*
(JUst a Thought)
Although it is not mentioned anywhere on the site, Resilient is a Smalltalk-based language.
Here is a link to some notes taken at the latest ESUG conference:
http://wiki.eranova.si/esug/OOVM
Sure, try burning a CD with it, or encoding an MP3. Or connecting your favorite USB device. Then you will see why your desktop does not run in 128kb. Sounds like a job for the open source commmunity. Sounds like you have volunteered. I’ll be waiting for your groundbreaking project.
I’ll bet you five cents that could be done in less than 1.5GB. (Perhaps even under one or two meg, but don’t tell Microsoft.)
Embedded folks like data. What platforms are supported?
What chips? What is the interrupt latency? What is the
scheduling latency? How many concurrent activities
can i have (assuming no threads)? How about the file
system? What is the priority scheme? Etc.
The site has almost nothing.
640k should be enough for anybody. 😉
ps JOKE!
should be enough for anybody.
Oh wait, it is.
All that in 128K. Now why is present software so fat?
Linked lists are simple. Why don’t we use linked lists for all data storage? Perhaps because lookup and removal from linked lists are both O(n) operations, whereas in other data structures, such as b-trees, these operations are both O(log n).
Simple algorithms are not necessarily better. Often times they’re significantly worse.