Back to Results
First PageMeta Content
Scheduling / Classes of computers / Thread / Computer cluster / Workstation / Massively parallel / Idle / Central processing unit / Computing / Concurrent computing / Parallel computing


Scheduling Large-Scale Parallel Computations on Networks of Workstations Robert D. Blumofe and David S. Park MIT Laboratory for Computer Science Cambridge, Massachusetts
Add to Reading List

Document Date: 2014-09-16 08:27:50


Open Document

File Size: 170,21 KB

Share Result on Facebook

City

San Francisco / Burlington / Austin / Cancun / Asheville / Capri / Washington / D.C. / Park / Albuquerque / San Jose / Spokane / Santa Fe / Cambridge / San Diego / Chicago / /

Company

Distributed Computing Systems / MIT Laboratory / Benevolent Bandit Laboratory / Parform / IEEE Journal / David S. Park MIT Laboratory / /

Country

Italy / Mexico / United States / /

/

Event

Company Expansion / /

Facility

Benevolent Bandit Laboratory / Phish library / MIT Laboratory / Massachusetts Institute of Technology / /

IndustryTerm

split-phase communications / Parallel computing / ne-grain parallel applications / static processor / parallel applications / important applications / job assignment algorithms / toy applications / computing / fault tolerance so that applications / communications library / workstation network / shared virtual memory systems / workstation networks / dynamic parallel applications / typical workstation network / energy values / multi-layer communications library / large-scale parallel applications / interprocessor communications / user-level communication network / widearea networks / Preserve communications / cient parallel computing / individual applications / heterogeneous networks / non-preemptive round-robin scheduling algorithm / /

OperatingSystem

Unix / /

Organization

U.S. government / Massachusetts Institute of Technology / Advanced Research Projects Agency / MIT / Department of Electrical Engineering and Computer Science / MIT Center for Material Sciences and Engineering / /

Person

Kai Li / Edward W. Felten / Hans van Staveren / Michael J. Litzkow / Jonathan Sandberg / Miron Livny / Bradley C. Kuszmaul / Eve M. Schooler / Franz G. Amador / Paul Hudak / Charles Leiserson / Bill Weihl / Peter Steenkiste / Francois J. Bitz / Michael Halbherr / Charles E. Leiserson / Susan Owicki / V. S. Sunderam / Cezary Dubnicki / Steven Schlick / Matthieu Arnould / Andrew S. Tanenbaum / S. Chase / Matthias A. Blumrich / Michael N. Nelson / Robert D. Blumofe / Robbert van Renesse / Greg Nelson / Robert Halstead / Andrew R. Cherenson / Frans Kaashoek / Andrew Black / Andrew Tucker / Robert Sansom / Robert E. Felderman / Denise Ombres / Ryan Rifkin / Udi Manber / Robert H. Halstead / Jr. / Richard Lipton / Frederick Douglis / Anoop Gupta / Fred Christianson / Matt W. Mutka / Bradley Kuszmaul / Scott Blomquist / Vernon J. Rego / Richard Alpert / M. Frans Kaashoek / Henry M. Levy / Chris F. Joerg / Vijay Pande / Volker Strumpen / Eric C. Cooper / Onat Menzilcioglu / Brian Zill / Chris Joerg / Raphael Finkel / Guido van Rossum / Gregory J. Sharp / Jack Jansen / Sape J. Mullender / Yuli Zhou / Mike Halbherr / Andrew Birrell / Nicholas Carriero / Richard J. Little / Henri E. Bal / Edward Wobber / Brent B. Welch / John K. Ousterhout / Norman Hutchinson / Edward D. Lazowska / Leonard Kleinrock / /

Position

good scheduler / macro-level scheduler / basic / static scheduler / head / LIFO scheduler / rst worker / micro-level scheduler / idle-initiated scheduler / programmer / queen / executing Phish Head / macrolevel scheduler / hunter / round-robin scheduler / Worker Worker Worker Worker / scheduler / Tail Head / /

Product

Strata / /

ProgrammingLanguage

Lisp / C / /

ProvinceOrState

Washington / New Mexico / California / Arizona / Texas / Vermont / Illinois / North Carolina / Massachusetts / /

PublishedMedium

Communications of the ACM / /

Technology

Functional Programming / job assignment algorithms / operating system / dynamic processor / participating processors / one processor / Virtual memory / same algorithm / non-preemptive round-robin scheduling algorithm / Unix / static processor / ATM / UDP / operating systems / Process control / 3 processors / load balancing / simulation / 32 processors / Parallel Processing / /

SocialTag