Collections and garbage collection

Merrall, Simon C.; Padget, Julián

doi:10.1007/bfb0017208

Cited by 4 publications

(3 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Free memory lies between the stack and the top of the allocated heap by virtue of a compacting garbage collector [11].…”

Section: Blindpeumentioning

confidence: 99%

See 1 more Smart Citation

Parallel Execution of Nested Parallel Expressions

Merrall

1996

Journal of Parallel and Distributed Computing

Self Cite

View full text Add to dashboard Cite

“…Free memory lies between the stack and the top of the allocated heap by virtue of a compacting garbage collector [11].…”

Section: Blindpeumentioning

confidence: 99%

“…This way plural space slices can be shared between disjoint processor sets. A description of plural space management and PE allocation can be found in [11] and will be addressed further in a later paper.…”

Section: Data Organizationmentioning

confidence: 99%

Parallel Execution of Nested Parallel Expressions

Merrall

1996

Journal of Parallel and Distributed Computing

Self Cite

View full text Add to dashboard Cite

“…Higher-order functions have been discussed by Harrison [47], Bratvold [24], Maaßen [71] (who also discusses parallel data structures) and Darlington (et al) [29]. Parallel data-structures have been discussed by Hains and Mullin [43], Merral and Padget [78], Hill [55,56] and Axford and Joy [3].…”

Section: Surveymentioning

confidence: 99%

The Queen's University of Belfast

McCloy¹

1975

Aircraft Engineering and Aerospace Technology

View full text Add to dashboard Cite

It is generally a difficult task to construct efficient implementations of numerical mathematical algorithms for execution on high-performance computer systems. The difficulty arises from the need to express an implementation in a form that reflects the nature of the computer system, rather than a form that reflects the computations performed by the algorithm.This thesis develops the method of program transformation to derive automatically efficient implementations of algorithms from high-level, machine-independent specifications.The primary system considered is the AMT DAP array processor, but sequential and vector systems are also considered.The transformational method is further extended to automatically tailor implementations to use sparse programming techniques.

show abstract

The aim is laziness in a data-parallel language

Hill

1994

Workshops in Computing

View full text Add to dashboard Cite

Collections and garbage collection

Cited by 4 publications

References 4 publications

Parallel Execution of Nested Parallel Expressions

Parallel Execution of Nested Parallel Expressions

The Queen's University of Belfast

The aim is laziness in a data-parallel language

Contact Info

Product

Resources

About