Abstract
Lazy task creation (LTC) has proven to be an effective dynamic partitioning strategy for parallel Lisp systems. I describe here a key to the success of LTC (always package the parent instead of the child task at potential fork points) and two optimizations whose value extends to standard scheduling strategies (give scheduling preference to the child task, and use double-ended task queues). I also argue that research on real-world applications is strongly needed at this point as opposed to further system optimizations.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.