作者: Anne Benoit , Murray Cole , Stephen Gilmore , Jane Hillston
DOI: 10.1007/978-3-540-24688-6_40
关键词: Theoretical computer science 、 Algorithmic skeleton 、 Process calculus 、 Computer science 、 Scheduling (computing) 、 Grid application
摘要: We show in this paper how to evaluate the performance of skeleton-based high level parallel programs. Since many applications fol- low some commonly used algorithmic skeletons, we identify such skele- tons and model them with process algebra order get relevant in- formation about application, be able take "good" scheduling decisions. This concept is illustrated through case study Pipeline skeleton, a tool which generates auto- matically set models solves presented. Some numerical results are provided, proving efficiency approach.