| Document Date: 2014-11-11 12:04:07
Open Document File Size: 368,90 KBShare Result on Facebook
City Herzliya / Jersey City / / Company Knight Capital Group / IBM / / Country Israel / / / Event Force Majeure / Reorganization / / Facility The Interdisciplinary Center / / IndustryTerm cluster computing / line network / real-time scheduling algorithm / output solution / real-time scheduling / energy minimization / fixed processing time / real-time scheduling instances / feasible solution / arbitrary processing time / optical network / greedy algorithm / customer service systems / polynomial-time algorithm / network operator / start-up / β-approximation algorithm / natural applications / above algorithm / real-time scheduling problem / power systems / optimum solution / polynomial time exact algorithm / optical networks / unbounded capacity solution / cluster systems / determining the start-up / / Organization School of Computer / Interdisciplinary Center / Computer Science Department / Technion / / Person Tami Tamir / Rohit Khandekar† Baruch Schieber / / Position General / / ProvinceOrState New Jersey / / PublishedMedium Theoretical Computer Science / / Technology β-approximation algorithm / real-time scheduling algorithm / above algorithm / load balancing / 4-approximation algorithm / 2-approximation algorithm / polynomial-time algorithm / 6 Algorithm / 5-approximation algorithm / /
SocialTag |
Real-time Scheduling to Minimize Machine Busy Times∗ Rohit Khandekar† Baruch Schieber ‡