Sciweavers

1658 search results - page 232 / 332
» Implementing Bit-addressing with Specialization
Sort
View
PEPM
1993
ACM
15 years 8 months ago
Polyvariant Binding-Time Analysis For Applicative Languages
Binding-time analysis is a crucial component of an ofine partial evaluator. The accuracy of the binding-time information that it produces determines the degree of specialization o...
Charles Consel
PODC
1993
ACM
15 years 8 months ago
A Lower Bound on Wait-Free Counting
A counting protocol (mod m) consists of shared memory bits - referred to as the counter - and of a procedure for incrementing the counter value by 1 (mod m). The procedure may be ...
Shlomo Moran, Gadi Taubenfeld
ICS
1992
Tsinghua U.
15 years 8 months ago
The CODE 2.0 graphical parallel programming language
CODE 2.0 is a graphical parallel programming system that targets the three goals of ease of use, portability, and production of efficient parallel code. Ease of use is provided by...
Peter Newton, James C. Browne
AOSD
2007
ACM
15 years 8 months ago
Applying aspects to a real-time embedded operating system
The application of aspect-oriented programming (AOP) to the embedded operating system domain is still a very controversial topic, as this area demands high performance and small m...
Francisco Afonso, Carlos A. Silva, Sergio Monteneg...
CONEXT
2007
ACM
15 years 8 months ago
Backpressure multicast congestion control in mobile ad-hoc networks
In mobile ad-hoc networks, the multicast paradigm is of central importance. It can help to save scarce medium bandwidth if packets are to be delivered to multiple destinations. We...
Björn Scheuermann, Matthias Transier, Christi...