Amortized efficiency of list update and paging rules
Communications of the ACM
Minimizing mean flow time with release time constraint
Theoretical Computer Science
Approximability and nonapproximability results for minimizing total flow time on a single machine
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Approximation algorithms for scheduling
Approximation algorithms for NP-hard problems
Approximating total flow time on parallel machines
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Log-time algorithms for scheduling single and multiple channel data broadcast
MobiCom '97 Proceedings of the 3rd annual ACM/IEEE international conference on Mobile computing and networking
Online computation and competitive analysis
Online computation and competitive analysis
Minimizing the flow time without migration
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Scheduling to minimize average completion time: off-line and on-line algorithms
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
The power of migration in multi-processor scheduling of real-time systems
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Flow and stretch metrics for scheduling continuous job streams
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Eliminating migration in multi-processor scheduling
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Dynamic Memory Allocation for Multiple-Query Workloads
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
Online Scheduling to Minimize Average Stretch
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Connection Scheduling in Web Servers
Connection Scheduling in Web Servers
Task Assignment in a Distributed System: Improving Performance by Unbalancing Load
Task Assignment in a Distributed System: Improving Performance by Unbalancing Load
A Scheduling Framework for Web Server Clusters with Intensive Dynamic Content Processing
A Scheduling Framework for Web Server Clusters with Intensive Dynamic Content Processing
Algorithms for minimizing weighted flow time
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Approximation schemes for preemptive weighted flow time
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Non-clairvoyant Scheduling for Minimizing Mean Slowdown
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Online real-time preemptive scheduling of jobs with deadlines
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Non-clairvoyant scheduling for weighted flow time
Information Processing Letters
Average stretch without migration
Journal of Computer and System Sciences
Scheduling data transfers in a network and the set scheduling problem
Journal of Algorithms
Multi-processor scheduling to minimize flow time with ε resource augmentation
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Scheduling against an adversarial network
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
The Granularity Metric for Fine-Grain Real-Time Scheduling
IEEE Transactions on Computers
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
New resource augmentation analysis of the total stretch of SRPT and SJF in multiprocessor scheduling
Theoretical Computer Science
ACM Transactions on Algorithms (TALG)
How to Balance the Load on Heterogeneous Clusters
International Journal of High Performance Computing Applications
New resource augmentation analysis of the total stretch of SRPT and SJF in multiprocessor scheduling
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Greedy multiprocessor server scheduling
Operations Research Letters
| Hi-index | 0.00 |