JPL Technical Report Server

Options for parallelizing a planning and scheduling algorithm

Show simple item record

dc.contributor.author Clement, Bradley J.
dc.contributor.author Estlin, Tara A.
dc.contributor.author Bornstein, Benjamin D
dc.date.accessioned 2013-08-07T22:35:17Z
dc.date.available 2013-08-07T22:35:17Z
dc.date.issued 2011-06-15
dc.identifier.citation Calipso/CloudSat Science Team Meeting, Montreal, Canada, June 15, 2011. en_US
dc.identifier.clearanceno 11-1804
dc.identifier.uri http://hdl.handle.net/2014/43483
dc.description.abstract Space missions have a growing interest in putting multi-core processors onboard spacecraft. For many missions processing power significantly slows operations. We investigate how continual planning and scheduling algorithms can exploit multi-core processing and outline different potential design decisions for a parallelized planning architecture. This organization of choices and challenges helps us with an initial design for parallelizing the CASPER planning system for a mesh multi-core processor. This work extends that presented at another workshop with some preliminary results. en_US
dc.description.sponsorship NASA/JPL en_US
dc.language.iso en_US en_US
dc.publisher Pasadena, CA : Jet Propulsion Laboratory, National Aeronautics and Space Administration, 2011. en_US
dc.subject parallel algorithms en_US
dc.subject image processing en_US
dc.subject scheduling software en_US
dc.subject Planning software en_US
dc.subject parallelize algorithm computation en_US
dc.title Options for parallelizing a planning and scheduling algorithm en_US
dc.type Preprint en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search


Browse

My Account