|
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/352
|
Full metadata record
| DC Field | Value | Language |
|---|
| contributor.author | Sahoo, Bibhudatta | - |
| contributor.author | Ekka, A A | en |
| date.accessioned | 2006-11-16T08:10:02Z | - |
| date.available | 2006-11-16T08:10:02Z | - |
| date.issued | 2006 | - |
| identifier.citation | Proceedings of the National Conference on Computer Science and Technology, 11-12 Nov 2006, KIET, Ghaziabad | en |
| identifier.uri | http://hdl.handle.net/2080/352 | - |
| description | Copyright for this paper belongs to KIET | en |
| description.abstract | Performance of distributed systems can be improved from scheduling of tasks aspect. A good
scheduling algorithm can enhance the performance of the distributed system significantly. In this
paper we have compared the performance of batch mode and immediate mode schedulers in
heterogeneous distributed computing environment. An immediate mode scheduler only considers a
single task for scheduling on a FCFS (first come, first served) basis while a batch mode scheduler
considers a number of tasks at once for scheduling. In particular we have used two immediate mode
scheduler: (i) the earliest first (EF) algorithm and (ii) the lightest loaded (LL), and two batch mode
heuristic scheduler (i) the max-min (MX) scheduler and (ii) min-min (MM) scheduler. The main aim of
max-min (MX) scheduler is to have the largest tasks scheduled as early as possible, with smaller
tasks at the end filling in the gaps. The min-min (MM) scheduler is similar to the MX scheduler, except
tasks are sorted in ascending order according to size. We have simulated the scheduler behavior with
our simulator developed using Matlab, where each task is with the expected execution time and
expected completion time on a particular machine. This findings are used to design an adaptive
dynamic scheduler that selects the best strategy depending on load at a particular time frame. The
results are also useful in deciding the effective group size of a processor pool (cluster) for the HDCS,
which can be remodeled as a tree of resource clusters that are geographically distributed. We have
also outline the proposed scheduler framework that uses (i) a global scheduler, responsible for
determining where to send task submitted to it, a local scheduler, responsible for determining the
order in which tasks are executed at that particular processor pool. | en |
| format.extent | 511348 bytes | - |
| format.mimetype | application/pdf | - |
| language.iso | en | - |
| publisher | KIET, Ghaziabad | en |
| title | Performance Analysis Of Concurrent Tasks Scheduling Schemes In A Heterogeneous Distributed Computing System | en |
| type | Article | en |
| Appears in Collections: | Conference Papers
|
Files in This Item:
| File |
Description |
Size | Format |
|---|
| bdsahoo.pdf | | 286Kb | Adobe PDF | View/Open |
|
Show simple item record
All items in DSpace are protected by copyright, with all rights reserved.
|
