Skip to main navigation
Skip to search
Skip to main content
New Jersey Institute of Technology Home
Help & FAQ
Home
Profiles
Research units
Facilities
Federal Grants
Research output
Press/Media
Search by expertise, name or affiliation
Scheduling parallelizable jobs online to minimize the maximum flow time
Kunal Agrawal
,
Jing Li
, Kefu Lu
, Benjamin Moseley
Research output
:
Chapter in Book/Report/Conference proceeding
›
Conference contribution
13
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Scheduling parallelizable jobs online to minimize the maximum flow time'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Arrival Rate
25%
Arrival Time Distribution
25%
Curve Model
25%
Directed Acyclic Graph
25%
First-in-first-out
25%
Latency
25%
Maximum Flow Time
100%
Model Dynamics
25%
Model Parallel
25%
Non-clairvoyant
25%
Online Environment
25%
Online Scheduling
25%
Optimal Schedulers
25%
Parallel Jobs
100%
Resource Augmentation
25%
Scheduler
50%
Speedup Curves
25%
Stylised Model
25%
Synthetic Workload
25%
Tight
25%
Weighted Flow Time
25%
Work Distribution
25%
Work Stealing
75%
Work Study
25%
Work-stealing Scheduler
25%
Computer Science
Directed Acyclic Graph
100%
First-in-First-Out
100%
Maximum Latency
100%
Parallel Model
100%
Mathematics
arrival rate λ
50%
Arrival Time
50%
Directed Acyclic Graph
50%
Minimizes
100%
Model Dynamic
50%