Sgall Ji

Ji Sgall

Information about the author Ji Sgall will soon be added to the site.
Found 6 papers in total
General Caching Is Hard: Even with Small Pages
General Caching Is Hard: Even with Small Pages
2017
Caching (also known as paging ) is a classical problem concerning page replacement...
Optimal and online preemptive scheduling on uniformly related machines
Optimal and online preemptive scheduling on uniformly related machines
2009
We consider the problem of preemptive scheduling on uniformly related machines. We...
Algorithms for testing fault-tolerance of sequenced jobs
Algorithms for testing fault-tolerance of sequenced jobs
2009
We study the problem of testing whether a given set of sequenced jobs can tolerate...
A lower bound for on-line scheduling on uniformly related machines
A lower bound for on-line scheduling on uniformly related machines
2000
We consider the problem of on-line scheduling of jobs arriving one by one on uniformly...
Randomized on-line scheduling on two uniform machines
Randomized on-line scheduling on two uniform machines
2001
We study the problem of on-line scheduling on two uniform machines with speeds 1 and s...
Semi-online scheduling with decreasing job sizes
Semi-online scheduling with decreasing job sizes
2000
We investigate the problem of semi-online scheduling jobs on m identical parallel...
Papers per page: