864 Hits in 4.8 sec

A slowdown model for applications executing on time-shared clusters of workstations

S.M. Figueira, F. Berman
2001 IEEE Transactions on Parallel and Distributed Systems  
In this paper, we define a model that calculates the slowdown imposed on applications in time-shared multi-user clusters.  ...  In this paper, we extend this work to develop a contention model for application performance on clusters of workstations.  ...  They would also like to thank Professor Joseph Pasquale for the usage of the machines in the Computer Systems Laboratory at UCSD.  ... 
doi:10.1109/71.932718 fatcat:ohapwwpqcbb4racgf6sjjw2q2i

Adaptive memory allocations in clusters to handle unexpectedly large data-intensive jobs

Li Xiao, Songquing Chen, Xiaodong Zhang
2004 IEEE Transactions on Parallel and Distributed Systems  
In a cluster system with dynamic load sharing support, a job submission or migration to a workstation is determined by the availability of CPU and memory resources of the workstation at the time [21] .  ...  The first scheme, Network RAM supported load sharing, combines job migrations with network RAM, which uses remote execution to initially allocate a job to the most lightly loaded workstation and, if necessary  ...  The work is also a part of an independent research project sponsored by the US National Science Foundation for its program directors and visiting scientists.  ... 
doi:10.1109/tpds.2004.15 fatcat:s6qdvs5spfed5azhopdbm7b4oi

Towards load balancing support for I/O-intensive parallel jobs in a cluster of workstations

Xiao Qin, Hong Jian, Yifeng Zhu, Swanson
2003 Proceedings IEEE International Conference on Cluster Computing CLUSTR-03  
Moreover, the proposed schemes judiciously take into account both CPU and memory load sharing in the cluster, thereby maintaining a high performance for a wide spectrum of workload.  ...  for a diverse set of workload conditions.  ...  Work was completed using the Research Computing Facility at University of Nebraska-Lincoln. We are grateful to the anonymous referees for their insightful suggestions and comments.  ... 
doi:10.1109/clustr.2003.1253305 dblp:conf/cluster/QinJZS03 fatcat:i57qhipqs5cmldqtqpe47gfhou

Resource Matching in Non-dedicated Multicluster Environments [chapter]

Josep Lluis Lérida, Francesc Solsona, Francesc Giné, Jose Ramon García, Porfidio Hernández
2008 Lecture Notes in Computer Science  
In this paper, we present a new resource-matching model for MetaLoRaS, which is aimed at mitigating the degraded turnaround time of co-allocated jobs, caused by the contention on shared inter-cluster links  ...  The model is linear programming based and considers the availability of computational resources and the contention of shared inter and intra-cluster links.  ...  Moreover, we tested the prediction accuracy of the execution time executing parallel applications in a real environment.  ... 
doi:10.1007/978-3-540-92859-1_16 fatcat:byuzoexrsrc65mdm3kgha4gbiu

Exploiting fine-grained idle periods in networks of workstations

Kyung Dong Ryu, J.K. Hollingsworth
2000 IEEE Transactions on Parallel and Distributed Systems  
AbstractÐStudies have shown that for a significant fraction of the time, workstations are idle.  ...  Our study shows that the Linger-Longer policy can improve the throughput of foreign jobs on a cluster by 60 percent with only a 0.5 percent slowdown of local jobs.  ...  ACKNOWLEDGMENTS The authors would like to thank Pete Keleher and Dejan Perkovic for helping us combine their CVM simulator with the Linger-Longer simulator. Anurag Acharya and Remzi H.  ... 
doi:10.1109/71.877793 fatcat:66cp7jtqmbbnfnoskugly4kcwi

Empirical evaluation of shared parallel execution on independently scheduled clusters

M. Ghanesh, S. Kumar, J. Subhlok
2005 CCGrid 2005. IEEE International Symposium on Cluster Computing and the Grid, 2005.  
Parallel machines are typically space shared, or time shared such that only one application executes on a group of nodes at any given time.  ...  It is generally assumed that executing multiple parallel applications simultaneously on a group of independently scheduled nodes is not efficient because of synchronization requirements.  ...  In both of these models, only a single application executes on a group of processors at a given time. We will refer to this basic approach as gang scheduling in this paper.  ... 
doi:10.1109/ccgrid.2005.1558570 dblp:conf/ccgrid/GhaneshKS05 fatcat:peeub6zcrje77l7x5xokftm36e

Fine-Grain Cycle Stealing for Networks of Workstations

Kyung Dong Ryu, J.K. Hollingsworth
1998 Proceedings of the IEEE/ACM SC98 Conference  
Our study shows that the Linger-Longer policy can improve the throughput of foreign jobs on cluster by 60% with only a 0.5% slowdown of foreground jobs.  ...  Studies have shown that a significant fraction of the time, workstations are idle.  ...  We also appreciate the useful comments of Bryan Buck and the anonymous reviewers.  ... 
doi:10.1109/sc.1998.10011 dblp:conf/sc/RyuH98 fatcat:mdilzhonvrgudgnlmijq76hz2a

Improving the performance of I/O-intensive applications on clusters of workstations

Xiao Qin, Hong Jiang, Yifeng Zhu, David R. Swanson
2006 Cluster Computing  
Load balancing in a workstation-based cluster system has been investigated extensively, mainly focusing on the effective usage of global CPU and memory resources.  ...  In this paper, two I/O-aware load-balancing schemes, referred to as IOCM and WAL-PM, are presented to improve the overall performance of a cluster system with a general and practical workload including  ...  Work was completed using the Research Computing Facility at the University of Nebraska-Lincoln. We are grateful to the anonymous referees for their insightful suggestions and comments.  ... 
doi:10.1007/s10586-006-9742-7 fatcat:uqgvm6hhu5gr5dbmpq63k5jswy

Building MPI for Multi-Programming Systems Using Implicit Information [chapter]

Frederick C. Wong, Andrea C. Arpaci-Dusseau, David E. Culler
1999 Lecture Notes in Computer Science  
In this paper, we describe our implementation of MPI using implicit information for global coscheduling.  ...  Further, the integration of implicit co-scheduling with the MPI runtime system achieves robust performance in a multi-programming environment, without compromising performance in dedicated use.  ...  Acknowledgments We would like to thank Shirley Chiu, Brent Chun, Richard Martin, Alan Mainwaring, and Remzi Arpaci-Dusseau for their many helpful comments and discussions on this work.  ... 
doi:10.1007/3-540-48158-3_27 fatcat:wrrune2xyfhd5p63tgo4usrkh4

Dynamic cluster resource allocations for jobs with known and unknown memory demands

Li Xiao, Songqing Chen, Xiaodong Zhang
2002 IEEE Transactions on Parallel and Distributed Systems  
AbstractÐThe cluster system we consider for load sharing is a compute farm which is a pool of networked server nodes providing high-performance computing for CPU-intensive, memory-intensive, and I/O active  ...  We study two types of application workloads: 1) Memory demands are known in advance or are predictable and 2) memory demands are unknown and dynamically changed during execution.  ...  Yanxia Qu participated in the work of the load sharing project in the early stage.  ... 
doi:10.1109/71.993204 fatcat:pzz2er6fdjgfheut4ddrst6xd4

Towards a thread-based parallel direct execution simulator

P. Dickens, M. Haines, P. Mehrotra, D. Nicol
1996 Proceedings of HICSS-29: 29th Hawaii International Conference on System Sciences  
Parallel direct execution simulation is an important tool for performance and scalability analysis of large message passing parallel programs executing on top of a virtual computer.  ...  In this paper we describe an initial implementation of a threadbased parallel direct execution simulator.  ...  The slowdowns measured for LAPSE on a workstation cluster are generally greater than those measured for LAPSE executing on the Intel Paragon.  ... 
doi:10.1109/hicss.1996.495490 dblp:conf/hicss/DickensHMN96 fatcat:2q6cmqhp6jg2pgtjqy2wnkc7gq

Teaching tools for parallel processing

Emina Milovanovic, Natalija Stojanovic
2005 Facta universitatis - series Electronics and Energetics  
Parallaxis is a sophisticated SIMD simulator which runs on a variety of platforms.jBACI shared memory simulator supports the MIMD model of computing with a common shared memory.PVM and MPI allow students  ...  to treat a network of workstations as a message passing MIMD multicomputer with distributed memory.  ...  Manuscript received February 2, 2004 The authors are with Faculty of Electronic Engineering, A. Medvedeva 14, 18 000 Niš, Serbia and Montenegro (e-mail:  ... 
doi:10.2298/fuee0502219m fatcat:2i5j75dgsfa2xjny6lwkp2fu2i

Adaptive scheduling under memory constraints on non-dedicated computational farms

Dimitrios S. Nikolopoulos, Constantine D. Polychronopoulos
2003 Future generations computer systems  
Using experiments on a cluster of workstations, we show that when a guest parallel job competes with general-purpose interactive, I/O-intensive, or CPU and memory-intensive load on the nodes of the cluster  ...  The slowdown of parallel jobs is reduced by up to a factor of 7.  ...  Acknowledgements An earlier version of this paper appeared in the Second IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGrid'02).  ... 
doi:10.1016/s0167-739x(03)00031-1 fatcat:7o53kcxjwvgjvkswyikxivdyfe

Overhead analysis of preemptive gang scheduling [chapter]

Atsushi Hori, Hiroshi Tezuka, Yutaka Ishikawa
1998 Lecture Notes in Computer Science  
The gang scheduler, called SCore-D, is implemented on top of a UNIX operating system and runs on workstation and PC clusters connected by Myrinet, a giga-bit class, high-performance network.  ...  NAS parallel benchmark programs are used for the evaluation. We found that the message ushing time and network preemption time depends on the communication patterns of the application programs.  ...  Currently SCore-D is running on SunOS, NetBSD and LINUX. Our cluster software system including SCore-D, MPC++, PM, and MPI with PM is available at  ... 
doi:10.1007/bfb0053989 fatcat:6ogx4xsb4baxtcpb2de7mhkyra

Dynamic Parallel Job Scheduling in Multi-cluster Computing Systems [chapter]

J. H. Abawajy
2004 Lecture Notes in Computer Science  
In this paper, we address an on-line parallel job scheduling problem in heterogeneous multi-cluster computing systems.  ...  Job scheduling is a complex problem, yet it is fundamental to sustaining and improving the performance of parallel processing systems.  ...  The help of Maliha Omar is also greatly appreciated.  ... 
doi:10.1007/978-3-540-24685-5_4 fatcat:53foztfkibalzd7skmvdyvsdja
« Previous Showing results 1 — 15 out of 864 results