Sciweavers

437 search results - page 50 / 88
» Quincy: fair scheduling for distributed computing clusters
Sort
View
IPPS
1998
IEEE
15 years 9 months ago
Comparing the Optimal Performance of Different MIMD Multiprocessor Architectures
We compare the performance of systems consisting of one large cluster containing q processors with systems where processors are grouped into k clusters containing u processors eac...
Lars Lundberg, Håkan Lennerstad
IPPS
1998
IEEE
15 years 10 months ago
Utilization and Predictability in Scheduling the IBM SP2 with Backfilling
Scheduling jobs on the IBM SP2 system is usually done by giving each job a partition of the machine for its exclusive use. Allocating such partitions in the order that the jobs ar...
Dror G. Feitelson, Ahuva Mu'alem Weil
IWCC
1999
IEEE
15 years 10 months ago
Design and Analysis of the Alliance/University of New Mexico Roadrunner Linux SMP SuperCluster
This paper will discuss high performance clustering from a series of critical topics: architectural design, system software infrastructure, and programming environment. This will ...
David A. Bader, Arthur B. Maccabe, Jason R. Mastal...
CCGRID
2010
IEEE
15 years 7 months ago
Designing Accelerator-Based Distributed Systems for High Performance
Abstract--Multi-core processors with accelerators are becoming commodity components for high-performance computing at scale. While accelerator-based processors have been studied in...
M. Mustafa Rafique, Ali Raza Butt, Dimitrios S. Ni...
CSCW
2002
ACM
15 years 6 months ago
Work rhythms: analyzing visualizations of awareness histories of distributed groups
We examined records of minute-by-minute computer activity coupled with information about the location of the activity, online calendar appointments, and e-mail activity. We presen...
James Begole, John C. Tang, Randall B. Smith, Nico...