|
DSpace@nitr >
National Institue of Technology- Rourkela >
Conference Papers >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/2080/622
|
Full metadata record
| DC Field | Value | Language |
|---|
| contributor.author | Chandra, Pushpendra Kumar | - |
| contributor.author | Sahoo, Bibhudatta | - |
| date.accessioned | 2008-03-13T12:59:10Z | - |
| date.available | 2008-03-13T12:59:10Z | - |
| date.issued | 2008 | - |
| identifier.citation | Proceedings of the 1st International Conference on Advances in Computing, Chikhli, India, 21-22 February 2008, P 1-4 | en |
| identifier.uri | http://hdl.handle.net/2080/622 | - |
| description | Copyright for the article belongs to Proceedings publisher | en |
| description.abstract | Load balancing techniques play a very important role in
developing high-performance cluster computing platforms. Many
load balancing polices achieve high system performance by
increasing the utilization of CPU, memory, or a combination of
CPU and memory. However, these load-balancing policies are
less effective when the workload comprises of a large number of
I/O-intensive tasks and I/O resources exhibit imbalanced load.
The I/O intensive tasks running on a heterogeneous cluster needs
effective usage of global I/O resources. We have proposed a loadbalancing
scheme based upon system heterogeneity and migrate
I/O-intensive tasks from with heavily loaded nodes to under
loaded nodes. The proposed load balancing scheme can minimizes
the average slow down of all parallel jobs running on a cluster and
reduces the average response time of the jobs. | en |
| format.extent | 731460 bytes | - |
| format.mimetype | application/pdf | - |
| language.iso | en | - |
| title | A Novel Load Balancing Algorithm for I/O-intensive Load in Heterogeneous Cluster | en |
| type | Article | en |
| Appears in Collections: | Conference Papers
|
Files in This Item:
| File |
Description |
Size | Format |
|---|
| ICAC2008.pdf | | 714Kb | Adobe PDF | View/Open |
|
Show simple item record
All items in DSpace are protected by copyright, with all rights reserved.
|
