Efficient job division for grids running SIMD algorithms

DOI10.1007/978-3-642-14834-7_24MaRDI QIDQ3058849zbMATH OpenOpenAlexFDO

Authors Ashish Kurmi, Srinivasan M. Iyer

Publication date 7 December 2010

Published in Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-14834-7_24

zbMATH Keywords

Dynamic Grain Size algorithmRedistribution algorithm

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• scientific article; zbMATH DE number 833726
• Grid scheduling divisible loads from two sources
• Parallel Processing and Applied Mathematics
• On the performance-driven load distribution for heterogeneous computational grids
• Grid applications on distributed memory architectures: Implementation and evaluation

This page was built for publication: Efficient job division for grids running SIMD algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3058849)