A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Filters
SOAR: Smalltalk without bytecodes
1986
Conference proceedings on Object-oriented programming systems, languages and applications - OOPLSA '86
Abstract We have implemented Smalltalk-80 on an instructionlevel simulator for a RISC microcomputer called SOAR. ...
Measurements suggest that even a conventional computer can provide high performance for Smalltalk-80 by abandoning the 'Smalltalk Virtual Machine' in favor of compiling Smalltalk directly to SOAR machine ...
BS and SOAR are the only Smalltalk systems without object tables (Figs 3 and 4). ...
doi:10.1145/28697.28708
dblp:conf/oopsla/SamplesUH86
fatcat:tynxh6czwfgcbnqiisxqxvmqyy
SOAR: Smalltalk without bytecodes
1986
SIGPLAN notices
BS and SOAR are the only Smalltalk systems without object tables (Figs 3 and 4) . ...
Newb2s produces a Smalltalk image for SOAR by converting the BS objects to SOAR format and running Hilfinger's Slapdash compiler, which translates the bytecoded programs to SOAR instructions. ...
Smalltalk on 400ns SOAR will run as fast as the fastest known implementation, the Xerox Dorado. ...
doi:10.1145/960112.28708
fatcat:en6ot22invgvrffey256pxpnye
Architectural support for programming languages and operating systems
1991
Information and Software Technology
This p paper describes the compiler and how it was affected by SOAR architectural features. The com iler generates code of reasonable density and speed. ...
Because of Smalltalk-80's semantics, relat t tively few optimizations are possible, but hardware and software mechanisms at runtime offse hese limitations. ...
Tests with benchmarks indicate that SOAR Smalltalk would be 46% slower without them. 3 It is crucial that the size of these register windows be chosen wisely. ...
doi:10.1016/0950-5849(91)90065-j
fatcat:knvjyjya3bd3fg6bruqsfi4apy
Generation Scavenging
1984
SIGPLAN notices
We have incorporated Generation Scaveng. int. in Berkeley Smalltalk (BS), our Smalltalk-80* implementation, and instrumented it to obtain performance data. ...
Generation Scavenging is a reclamation algorithm that has no noticeable pauses, eliminates page faults for transient objects, compacts objects without resorting to indirection, and reclaims circular structures ...
Based on bytecode mix measurements, Deutsch has estimated that a 10 Mhz 68000 with no wait states could execute Smalltalk-80 bytecodes no faster than three times the Dolphin's rate [Deu82a] . ...
doi:10.1145/390011.808261
fatcat:qkk357kldzcahpo4rzusxfh2be
Generation Scavenging
1984
Software engineering notes
We have incorporated Generation Scaveng. int. in Berkeley Smalltalk (BS), our Smalltalk-80* implementation, and instrumented it to obtain performance data. ...
Generation Scavenging is a reclamation algorithm that has no noticeable pauses, eliminates page faults for transient objects, compacts objects without resorting to indirection, and reclaims circular structures ...
Based on bytecode mix measurements, Deutsch has estimated that a 10 Mhz 68000 with no wait states could execute Smalltalk-80 bytecodes no faster than three times the Dolphin's rate [Deu82a] . ...
doi:10.1145/390010.808261
fatcat:koezi452nfdstid3u5okxlqcci
Generation Scavenging
1984
Proceedings of the first ACM SIGSOFT/SIGPLAN software engineering symposium on Practical software development environments - SDE 1
We have incorporated Generation Scaveng. int. in Berkeley Smalltalk (BS), our Smalltalk-80* implementation, and instrumented it to obtain performance data. ...
Generation Scavenging is a reclamation algorithm that has no noticeable pauses, eliminates page faults for transient objects, compacts objects without resorting to indirection, and reclaims circular structures ...
Based on bytecode mix measurements, Deutsch has estimated that a 10 Mhz 68000 with no wait states could execute Smalltalk-80 bytecodes no faster than three times the Dolphin's rate [Deu82a] . ...
doi:10.1145/800020.808261
dblp:conf/sde/Ungar84
fatcat:k3bsazb3cradngdn7kp4p3swvi
A partial read barrier for efficient support of live object-oriented programming
2015
SIGPLAN notices
Spur, a new object representation and memory manager for Smalltalk-like languages, has neither of these deficiencies. ...
Live programming, originally introduced by Smalltalk and Lisp, and now gaining popularity in contemporary systems such as Swift, requires on-the-fly support for object schema migration, such that the layout ...
Smalltalk Execution Model The Smalltalk execution model (?) is that of methods executing bytecodes for a stack machine. ...
doi:10.1145/2887746.2754186
fatcat:7hghunibibdxnho4shyt45q6la
A partial read barrier for efficient support of live object-oriented programming
2015
Proceedings of the 2015 ACM SIGPLAN International Symposium on Memory Management - ISMM 2015
Spur, a new object representation and memory manager for Smalltalk-like languages, has neither of these deficiencies. ...
Live programming, originally introduced by Smalltalk and Lisp, and now gaining popularity in contemporary systems such as Swift, requires on-the-fly support for object schema migration, such that the layout ...
Smalltalk Execution Model The Smalltalk execution model (?) is that of methods executing bytecodes for a stack machine. ...
doi:10.1145/2754169.2754186
dblp:conf/iwmm/MirandaB15
fatcat:5wvm4qbw5bcynmt7iig4xu7g4m
Swamp: a fast processor for Smalltalk-80
1986
Conference proceedings on Object-oriented programming systems, languages and applications - OOPLSA '86
The machine can execute simple instructions at over 7M byteeodes per second and has a predicted average throughput of 1.9M bytecodes per second. ...
The machine is microprogrammed, and uses a simple next micro-address prediction strategy to obtain most of the performance of pipelining without the attendant complexity. ...
This processor, called Swamp (Smalltalk Without All that Much Pipelining), applies an important and general principle that is often used in creating efficient systems. ...
doi:10.1145/28697.28710
dblp:conf/oopsla/LewisGFT86
fatcat:o5submdcljcnfnxtmsgm5bhpka
The evolution of Smalltalk: from Smalltalk-72 through Squeak
2020
Proceedings of the ACM on Programming Languages (PACMPL)
We discuss them here for the benefit of readers without access to the simulation. Simple Examples We always typed this as our first evaluation after a new build. ...
This paper presents a personal view of the evolution of six generations of Smalltalk in which the author played a part, starting with Smalltalk-72 and progressing through Smalltalk-80 to Squeak and Etoys ...
For garbage collection, we started with the two-generation garbage collection (GC) scheme of the APDA Smalltalk, inspired by Dave Ungar's SOAR [Samples et al. 1986 ] memory system. ...
doi:10.1145/3386335
fatcat:p33btb4rmrdatoidubvy5bfoe4
A comparative performance evaluation of write barrier implementation
1992
SIGPLAN notices
Here we examine a range of write barrier implementations and evaluate their relative performance within a generation scavenging garbage collector for Smalltalk. OOPSL.4'92, pp. 92-IO!1 ...
It includes a bytecode interpreter for the instruction set defined in [3] , and we run a Smalltalk image cloned (converted into our format) from an earlier release of Smalltalk-80. ...
They measure system support for the programming activities that constitute typical interaction with the Smalltalk system, such as keyboard activity, compilation of methods to bytecodes, and browsing. ...
doi:10.1145/141937.141946
fatcat:vzo5jssnunayhnuc6oe6on6j4e
A comparative performance evaluation of write barrier implementation
1992
conference proceedings on Object-oriented programming systems, languages, and applications - OOPSLA '92
Here we examine a range of write barrier implementations and evaluate their relative performance within a generation scavenging garbage collector for Smalltalk. OOPSL.4'92, pp. 92-IO!1 ...
It includes a bytecode interpreter for the instruction set defined in [3] , and we run a Smalltalk image cloned (converted into our format) from an earlier release of Smalltalk-80. ...
They measure system support for the programming activities that constitute typical interaction with the Smalltalk system, such as keyboard activity, compilation of methods to bytecodes, and browsing. ...
doi:10.1145/141936.141946
dblp:conf/oopsla/HoskingMS92
fatcat:vmok26aapraptpspg3phuorgri
Object-oriented architectural support for a Java processor
[chapter]
1998
Lecture Notes in Computer Science
On future references to the same method, the cached native method can be executed directly without the need for interpretation. ...
Implementations of other languages such as Smalltalk and Forth have attempted to reduce some of these overheads. Address Address Data Control Signals 32 32 ...
Executing Java byte codes Smalltalk systems such as SOAR and Mushroom provide architectural support for efficient object addressing and dynamic dispatches [16] , [10] . ...
doi:10.1007/bfb0054098
fatcat:7cyo4gvgdfdmpa2ssqvugtm4ie
A novel processor architecture with exact tag-free pointers
2004
IEEE Micro
A native Java bytecode compiler developed for the architecture facilitates the execution of large existing programs. ...
Examples include the SOAR (Smalltalk On A RISC) [16] , SPUR (Symbolic Processing Using RISCs) [8] , and Symbolics [11] architectures. ...
More recently, Williams and Wolczko [17] suggest an objectbased memory architecture for Smalltalk. ...
doi:10.1109/mm.2004.2
fatcat:xikhleq4ffhdrmpivhsrfwykqa
A self-maintained memory module supporting DMM
2007
Proceedings of the 2007 international conference on Compilers, architecture, and synthesis for embedded systems - CASES '07
nature of object-oriented languages such as C++ and Java has created the need of a high-performance dynamic memory management (DMM); however, it is a challenging task to provide efficient reliable system without ...
Smalltalk systems such as SOAR, Intel 432 and Mushroom provide architectural support for efficient object addressing and accessing [12] [21] [5] . ...
However, it is hard to build a bounded time scheme without hardware support. ...
doi:10.1145/1289881.1289916
dblp:conf/cases/JiSQ07
fatcat:u6ut4obhsfeejkvdsudhanime4
« Previous
Showing results 1 — 15 out of 20 results