Sciweavers

18 search results - page 1 / 4
» Memory Allocation with Lazy Fits
Sort
View
IWMM
2000
Springer
144views Hardware» more  IWMM 2000»
13 years 8 months ago
Memory Allocation with Lazy Fits
Dynamic memory allocation is an important part of modern programming languages. It is important that it be done fast without wasting too much memory. Memory allocation using lazy ...
Yoo C. Chung, Soo-Mook Moon
PADL
2005
Springer
13 years 10 months ago
Functional Framework for Sound Synthesis
We present an application of functional programming in the domain of sound generation and processing. We use the lazy language Clean to define purely functional stream generators,...
Jerzy Karczmarczuk
CSREAESA
2006
13 years 6 months ago
Static Program Partitioning for Embedded Processors
Modern processors have a small on-chip local memory for instructions. Usually it is in the form of a cache but in some cases it is an addressable memory. In the latter, the user is...
Bageshri Sathe, Uday P. Khedker
HPCC
2005
Springer
13 years 10 months ago
Reducing Memory Sharing Overheads in Distributed JVMs
Distributed JVM systems enable concurrent Java applications to transparently run on clusters of commodity computers by supporting Java’s shared-memory model over multiple JVMs di...
Marcelo Lobosco, Orlando Loques, Claudio Luis de A...
IFL
1999
Springer
108views Formal Methods» more  IFL 1999»
13 years 9 months ago
Optimising Recursive Functions Yielding Multiple Results in Tuples in a Lazy Functional Language
Abstract. We discuss a new optimisation for recursive functions yielding multiple results in tuples for lazy functional languages, like Clean and Haskell. This optimisation improve...
John H. G. van Groningen