Sciweavers

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

12

IPPS
2000
IEEE

favoriteEmaildiscussreport

93views Distributed And Parallel Com...» more IPPS 2000»

Gang Scheduling with Memory Considerations

13 years 9 months ago

Gang Scheduling with Memory Considerations

Download www.cs.huji.ac.il

A major problem with time slicing on parallel machines is memory pressure, as the resulting paging activity damages the synchronism among a job’s processes. An alternative is to impose admission controls, and only admit jobs that ﬁt into the available memory. Despite suffering from delayed execution, this leads to better overall performance by preventing the harmful effects of paging and thrashing.

Anat Batat, Dror G. Feitelson

Real-time Traffic

Better Overall Performance | Distributed And Parallel Computing | IPPS 2000 | Memory Pressure | Paging Activity |

claim paper

Related Content

» A comparison of local and gang scheduling on a Beowulf cluster

» Feedbackdirected thread scheduling with memory considerations

» MemorySystem Design Considerations for DynamicallyScheduled Processors

» Scheduling Algorithms with Bus Bandwidth Considerations for SMPs

» Multiprocessor EnergyEfficient Scheduling with Task Migration Considerations

» Register File Design Considerations in Dynamically Scheduled Processors

» FineGrain Priority Scheduling on MultiChannel Memory Systems

» Architecture considerations for tracing incoherent rays

» Energy Efficient FixedPriority Scheduling for RealTime Systems on Variable Voltage Process...

Post Info
More Details (n/a)

Added	31 Jul 2010
Updated	31 Jul 2010
Type	Conference
Year	2000
Where	IPPS
Authors	Anat Batat, Dror G. Feitelson

Comments (0)