A1 - Błażewicz Jacek A2 - Machowiak M., Mounie G., Trystram D. PB - OWN N2 - In the paper, the problem of scheduling a set of n malleable tasks on m parallel computers is considered. The tasks may be executed by several processors simultaneously and the processing speed of a task is a function of the number of processors alloted. The problem is motivated by real-life applications of parallel computer systems in scientific computing of highly parallelizable tasks. Starting from the continuous version of the problem (i. e. where the tasks may require a fractional part of the resources), we propose a general approximation algorithm with a performance guarantee equal to 2. Then, some improvements are derived that lead to a very good average behavior of the scheduling algorithm. L1 - http://lib.psnc.pl/Content/507/10.12921_cmst.2000.06.01.25-40_Blazewicz.pdf L2 - http://lib.psnc.pl/Content/507 CY - Poznań ER - T1 - SUBOPTIMAL APPROACHES TO SCHEDULING MALLEABLE TASKS UR - http://lib.psnc.pl/dlibra/docmetadata?id=507