Back to Results
First PageMeta Content
Server hardware / Relational database management systems / Cross-platform software / Oracle Database / Scalability / Packing problem / Heuristic function / Server / Algorithm / Software / Mathematics / System software


Co-scheduling of disk head time in cluster-based storage Matthew Wachs, Gregory R. Ganger CMU-PDLOctoberParallel Data Laboratory
Add to Reading List

Document Date: 2009-01-27 17:53:21


Open Document

File Size: 410,43 KB

Share Result on Facebook

Company

IBM / NetApp / LSI / HP / Oracle / Symantec / EMC / Google / VMware / Intel / Microsoft / Facebook / Hitachi / Cisco / /

Facility

Parallel Data Laboratory Carnegie Mellon University / /

IndustryTerm

nearby solutions / acceptable solution / theoretical algorithms / faster solutions / storage server / server-fraction product / standalone server / satisfactory solution / possible solution / particular server / exponential search space / slowest server / much faster solutions / standalone storage server / left-bottom justified solutions / genetic algorithms / storage infrastructure / left-bottom justified solution / cluster-based storage systems / na¨ıve search / possible solutions / larger solution / search space / exhaustive search / approximate solutions / dedicated storage systems / approximation algorithms / /

OperatingSystem

Linux / /

Organization

Army Research Office / National Science Foundation / Department of Energy / Department of Defense / Parallel Data Laboratory Carnegie Mellon University Pittsburgh / /

Person

Gregory R. Ganger / Matthew Wachs / Fernandez de la Vega / /

Position

disk head time scheduler / administrator / head / disk head / /

ProvinceOrState

Pennsylvania / /

Technology

Approximation algorithms Approximation algorithms / one processor / Linux / 3.0 GHz processors / theoretical algorithms / approximation algorithms / scheduling algorithm / /

SocialTag