MATRIX-HPC Preliminary Results Architecture Execution Unit
Saved in:
| Title: | MATRIX-HPC Preliminary Results Architecture Execution Unit |
|---|---|
| Authors: | Kiran Ramamurthy, Dr. Ioan Raicu |
| Contributors: | The Pennsylvania State University CiteSeerX Archives |
| Source: | http://datasys.cs.iit.edu/reports/2014_GCASR14_poster-matrix-hpc-scheduling.pdf. |
| Publication Year: | 2009 |
| Collection: | CiteSeerX |
| Subject Terms: | Task Computing Execution Fabric for |
| Description: | • Efficiently scheduling large number of jobs over large scale distributed systems is very critical. • Today's state-of-the-art job schedulers mostly follow a centralized architecture that is master/slave architecture. • Aims at providing HPC support on top of MATRIX MTC framework. • In-corporates resource stealing with work stealing. • Scheduler chooses multiple nodes in random. • Requests for resource information on the nodes. • Validates if sufficient resources are available to complete the tasks. • If Yes, Breaks the task into sub-tasks and migrates it to the nodes selected. • Source receive the results after execution Abstract Working |
| Document Type: | text |
| File Description: | application/pdf |
| Language: | English |
| Relation: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.644.7501 |
| Availability: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.644.7501 http://datasys.cs.iit.edu/reports/2014_GCASR14_poster-matrix-hpc-scheduling.pdf |
| Rights: | Metadata may be used without restrictions as long as the oai identifier remains attached to it. |
| Accession Number: | edsbas.EAEE4DA0 |
| Database: | BASE |
Nájsť tento článok vo Web of Science | Abstract: | • Efficiently scheduling large number of jobs over large scale distributed systems is very critical. • Today's state-of-the-art job schedulers mostly follow a centralized architecture that is master/slave architecture. • Aims at providing HPC support on top of MATRIX MTC framework. • In-corporates resource stealing with work stealing. • Scheduler chooses multiple nodes in random. • Requests for resource information on the nodes. • Validates if sufficient resources are available to complete the tasks. • If Yes, Breaks the task into sub-tasks and migrates it to the nodes selected. • Source receive the results after execution Abstract Working |
|---|