Results 1 -
4 of
4
Omniware: A Universal Substrate for Web Programming
- World Wide Web Journal
, 1995
"... This paper describes Omniware, a system for producing and executing mobile code. Next generation Web applications will use mobile code to specify dynamic behavior in Web pages, implement new Web protocols and data formats, and dynamically distribute computation between servers and browsers. Like all ..."
Abstract
-
Cited by 30 (0 self)
- Add to MetaCart
This paper describes Omniware, a system for producing and executing mobile code. Next generation Web applications will use mobile code to specify dynamic behavior in Web pages, implement new Web protocols and data formats, and dynamically distribute computation between servers and browsers. Like all mobile code systems, Omniware provides portability and safety. The same compiled Omniware module can be executed transparently on different machines, and a module's access to host resources can be precisely controlled. In addition to portability and safety, Omniware has two unique features. First, Omniware is open. Omniware uses software fault isolation (SFI) to enforce safe execution of standard programming languages, enabling Web developers to leverage the vast store of existing software and programming expertise. For example, Omniware developers can use C++ to create programs for Web pages. Second, Omniware is fast. We evaluated Omniware under the Solaris 2.4 operating system on a SPARCstation 5 using eight C benchmark programs, including five programs from the C SPEC92 benchmark suite. We evaluated the performance of Omniware in two ways. First, we showed that Omniware modules can be represented compactly, reducing the space consumption compared to SunPro cc shared object files by an average of 38%. Second, we showed that Omniware modules execute at near native speeds. Including the runtime overhead necessary to ensure that Omniware modules are both portable and safe, our benchmark programs ran within 6% of native performance.
How to read floating point numbers accurately
- Proceedings of PLDI ’90
, 1990
"... Converting decimal scientific notation into binary floating point is nontrivial, but this conversion can be performed with the best possible accuracy without sacrificing efficiency. 1. ..."
Abstract
-
Cited by 20 (0 self)
- Add to MetaCart
Converting decimal scientific notation into binary floating point is nontrivial, but this conversion can be performed with the best possible accuracy without sacrificing efficiency. 1.
Omniware: A Universal Substrate for Mobile Code
, 1995
"... In this paper we describe Omniware, a system for producing and executing mobile code. Mobile code will be used in next generation Web applications to specify dynamic behavior in Web pages, implement new Web protocols and data formats, and dynamically distribute computation between servers and browse ..."
Abstract
-
Cited by 8 (0 self)
- Add to MetaCart
In this paper we describe Omniware, a system for producing and executing mobile code. Mobile code will be used in next generation Web applications to specify dynamic behavior in Web pages, implement new Web protocols and data formats, and dynamically distribute computation between servers and browsers. Like all mobile code systems, Omniware provides portability and safety. The same compiled Omniware module can be executed transparently on different machines, and a module's access to host resources can be precisely controlled. In addition to portability and safety, Omniware has two unique features. First, Omniware is open. The Omniware virtual machine, OmniVM, supports standard programming languages, enabling Web developers to leverage the vast store of existing software and programming expertise. OmniVM was designed to be a straightforward compilation target for a large variety of source languages. Second, Omniware is fast. We evaluate Omniware under the Solaris 2.4 operating system on...
The Problem
, 1994
"... ss, two students Ioanid Rosu and Dimitriy Betaneli succeeded. This note is a simplification of my original solution from 1991 and their solutions. Department of Mathematics Room 2-380, Massachusetts Institute of Technology, Cambridge, MA 02139, edelman@math.mit.edu 2 The IEEE Standard We begin ..."
Abstract
-
Cited by 3 (0 self)
- Add to MetaCart
ss, two students Ioanid Rosu and Dimitriy Betaneli succeeded. This note is a simplification of my original solution from 1991 and their solutions. Department of Mathematics Room 2-380, Massachusetts Institute of Technology, Cambridge, MA 02139, edelman@math.mit.edu 2 The IEEE Standard We begin by pointing out that the interval [1; 2] fixes a convenient choice for the exponent. Floating point numbers are uniformly spaced in this interval with gap ffl = 2 \Gamma52 . The interval [ 1 2 ; 1] contains as many floating point numbers with gap ffl=2. We assume that arithmetic is in the "round to nearest mode." For our purposes this specifies that the arithmetic operations of add, subtract, multiply, and divide compute the floating point number nearest to the infinitely precise result. We also need to recall the "round to even" rule which specifies tha

