Number of the records: 1  

Approximate throughput maximization in scheduling of parallel jobs on hypercubes

  1. SYS0371008
    LBL
      
    01445^^^^^2200277^^^450
    005
      
    20240103200227.7
    014
      
    $a 84873950334 $2 SCOPUS
    100
      
    $a 20120314d m y slo 03 ba
    101
    0-
    $a eng $d eng
    102
      
    $a SK
    200
    1-
    $a Approximate throughput maximization in scheduling of parallel jobs on hypercubes
    215
      
    $a 5 s.
    463
    -1
    $1 001 cav_un_epca*0348387 $1 010 $a 978-80-970179-4-1 $1 200 1 $a Information Technologies - Applications and Theory $f red. D. Pardubská $v S. 71-75 $1 210 $a Seňa $c Pont $d 2010 $1 702 1 $a Pardubská $b D. $4 340
    610
    0-
    $a scheduling
    610
    0-
    $a hypercubes
    700
    -1
    $3 cav_un_auth*0246312 $a Zajíček $b Ondřej $i Matematická logika a teoretická informatika $j Mathematical Logic and Theoretical Computer Science $l MLTCS $p MU-W $4 070 $T Matematický ústav AV ČR, v. v. i.
    856
      
    $u http://ceur-ws.org/Vol-683/paper11.pdf
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.