Isaac Kar-Keung To

According to our database1, Isaac Kar-Keung To authored at least 23 papers between 1999 and 2013.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2013
Online Speed Scaling Based on Active Job Count to Minimize Flow Plus Energy.
Algorithmica, 2013

2012
Improved multi-processor scheduling for flow time and energy.
J. Sched., 2012

2010
Deadline scheduling and power management for speed bounded processors.
Theor. Comput. Sci., 2010

2009
Sleep with Guilt and Work Faster to Minimize Flow Plus Energy.
Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009

2008
Nonmigratory Multiprocessor Scheduling for Response Time and Energy.
IEEE Trans. Parallel Distributed Syst., 2008

Competitive non-migratory scheduling for flow time and energy.
Proceedings of the SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2008

Speed Scaling Functions for Flow Time Scheduling Based on Active Job Count.
Proceedings of the Algorithms, 2008

2007
Energy Efficient Deadline Scheduling in Two Processor Systems.
Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

2005
Nonmigratory Online Deadline Scheduling on Multiprocessors.
SIAM J. Comput., 2005

A Tighter Extra-Resource Analysis of Online Deadline Scheduling.
J. Comb. Optim., 2005

2004
Extra Processors versus Future Information in Optimal Deadline Scheduling.
Theory Comput. Syst., 2004

Performance guarantee for EDF under overload.
J. Algorithms, 2004

Aggressive Online Deadline Scheduling.
Proceedings of Computing: The Australasian Theory Symposium, 2004

Non-migratory online deadline scheduling on multiprocessors.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

2003
On-line scheduling with tight deadlines.
Theor. Comput. Sci., 2003

Competitive Deadline Scheduling via Additional or Faster Processors.
J. Sched., 2003

2002
On-line load balancing of temporary tasks revisited.
Theor. Comput. Sci., 2002

2001
Performance guarentee for online deadline scheduling in the presence of overload.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

On-Line Scheduling with Tight Deadlines.
Proceedings of the Mathematical Foundations of Computer Science 2001, 2001

On the speed requirement for optimal deadline scheduling in overloaded systems.
Proceedings of the 15th International Parallel & Distributed Processing Symposium (IPDPS-01), 2001

2000
On-line deadline scheduling under relaxed metrics of optimality
PhD thesis, 2000

1999
Trade-offs Between Speed and Processor in Hard-Deadline Scheduling.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

On-Line Load Balancing of Temporary Tasks Revisited.
Proceedings of the Algorithms and Computation, 10th International Symposium, 1999


  Loading...