Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

15

JSSPP
1998
Springer

favoriteEmaildiscussreport

102views Distributed And Parallel Com...» more JSSPP 1998»

Improving First-Come-First-Serve Job Scheduling by Gang Scheduling

13 years 9 months ago

Improving First-Come-First-Serve Job Scheduling by Gang Scheduling

Download www-ds.e-technik.uni-dortmund.de

Abstract. We present a new scheduling method for batch jobs on massively parallel processor architectures. This method is based on the First

Uwe Schwiegelshohn, Ramin Yahyapour

Real-time Traffic

Distributed And Parallel Computing | First Comefirstserve Strategy | JSSPP 1998 | Parallel Processor Architectures | Real Parallel Computers |

claim paper

Related Content

» Dynamic Grid Scheduling Using Job Runtime Requirements and Variable Resource Availability

» Improving Throughput and Utilization in Parallel Machines through Concurrent Gang

» An Efficient Processor Allocation Strategy that Maintains a High Degree of Contiguity amon...

» On the Use of NSGrid for Accurate Grid Schedule Evaluation

» ConfigurationSensitive Process Scheduling for FPGABased Computing Platforms

» Improving Parallel Job Scheduling by Combining Gang Scheduling and Backfilling Techniques

» Improving Gang Scheduling through job performance analysis and malleability

» Prospects of Collaboration between Compute Providers by Means of Job Interchange

» Improving Bandwidth Utilization Based on Deterministic Delay Bound in ConnectionOriented N...

Post Info
More Details (n/a)

Added	06 Aug 2010
Updated	06 Aug 2010
Type	Conference
Year	1998
Where	JSSPP
Authors	Uwe Schwiegelshohn, Ramin Yahyapour

Comments (0)