Paper Search Console

Home Search Page About Contact

Journal Title

Title of Journal: J Supercomput

Search In Journal Title:

Abbravation: The Journal of Supercomputing

Search In Journal Abbravation:

Publisher

Springer US

Search In Publisher:

DOI

10.1002/cbdv.201300179

Search In DOI:

ISSN

1573-0484

Search In ISSN:
Search In Title Of Papers:

Task scheduling for heterogeneous computing system

Authors: Shaikhah AlEbrahim Imtiaz Ahmad
Publish Date: 2016/11/09
Volume: 73, Issue: 6, Pages: 2313-2338
PDF Link

Abstract

Efficient scheduling of tasks in heterogeneous computing systems is of primary importance for highperformance execution of programs The programs are to be considered as multiple sequences of tasks that are presented as directed acyclic graphs DAG Each task has its own execution timeline that incorporates into multiple processors Moreover each edge on the graph represents constraints between the sequenced tasks In this paper we propose a new list–scheduling algorithm that schedules the tasks represented in the DAG to the processor that best minimizes the total execution time by taking into consideration the restriction of crossover between processors This objective will be achieved in two major phases a computing priorities of each task that will be executed and b selecting the processor that will handle each task The first phase priorities computation focuses on finding the best execution sequence that minimizes the makespan of the overall execution In listscheduling algorithm the quality of the solution is very sensitive to the priority assigned to the tasks Therefore in this paper we include an enhanced calculation of weight that is used in the ranking equation for determining the priority of tasks The second phase processor selection primarily focuses on allocating a processor that is a best fit for each task to be executed In this paper we enhance the processor selection by introducing a randomized decision mechanism based on a threshold which decides whether the task be assigned to the processor with the lowest execution time or to the processor that produces the lowest finish time This mechanism considers a balanced combination of the local and global optimal results to explore the search space efficiently to optimize the overall makespan The proposed algorithm is evaluated on different randomly generated DAGs and results are compared with the wellknown existing approaches to show the effectiveness of the proposed algorithm in reducing the makespan of execution The experiment’s results show improvement in the makespan that reaches up to 6–7

Keywords:

References

.
Search In Abstract Of Papers:
Other Papers In This Journal:
  1. Fault-tolerant broadcast in anonymous systems
  2. A hyper-heuristic approach for resource provisioning-based scheduling in grid environment
  3. Constructing data supply chain based on layered PROV
  4. A localization algorithm for large scale mobile wireless sensor networks: a learning approach
  5. Comment on “A general model for long-tailed network traffic approximation”
  6. Direct private query in location-based services with GPU run time analysis
  7. A randomized clustering of anonymous wireless ad hoc networks with an application to the initialization problem
  8. GPU-based parallel genetic approach to large-scale travelling salesman problem
  9. SENFIS: a Sensor Node File System for increasing the scalability and reliability of Wireless Sensor Networks applications
  10. The panconnectivity and the pancycle-connectivity of the generalized base- b hypercube
  11. 3-Hierarchical resource management model on web grid service architecture
  12. Research challenges and perspectives on Wisdom Web of Things (W2T)
  13. A novel framework for social web forums’ thread ranking based on semantics and post quality features
  14. Conditional forwarding: simple flow control to increase adaptivity for fully adaptive routing algorithms
  15. A proposal on location data supplementing information transfer method over MANET
  16. A framework for SaaS software packages evaluation and selection with virtual team and BOCR of analytic network process
  17. Real-time blind audio source separation: performance assessment on an advanced digital signal processor
  18. High-efficient video compression for social multimedia distribution
  19. RCB: leakage-resilient authenticated encryption via re-keying
  20. A framework for efficient performance prediction of distributed applications in heterogeneous systems
  21. Reducing the search space by closure and simplification paradigms
  22. P2P resource searching with Cloning Random Walker assisted by Weakly Connected Dominating Set
  23. Cost and energy aware service provisioning for mobile client in cloud computing environment
  24. PerContRep: a practical reputation system for pervasive content services
  25. Integrating 3D image descriptors of margin sharpness and texture on a GPU-optimized similar pulmonary nodule retrieval engine
  26. Exploring the speedups of embedded microprocessor systems utilizing a high-performance coprocessor data-path
  27. Tuning remote GPU virtualization for InfiniBand networks
  28. Energy efficient utilization of resources in cloud computing systems
  29. The election problem in asynchronous distributed systems with bounded faulty processes
  30. Dynamic-width reconfigurable parallel prefix circuits
  31. Editorial: special issue on parallel nature-inspired optimization
  32. Combating I-O bottleneck using prefetching: model, algorithms, and ramifications
  33. Editorial of special section on advanced in high performance, algorithm, and framework for future computing
  34. Hierarchical multichannel-based integrated smart metering infrastructure
  35. A learning automata-based heuristic algorithm for solving the minimum spanning tree problem in stochastic graphs
  36. Distributed identification of the lineality space of a cone
  37. On studying business models in mobile social networks based on two-sided market (TSM)
  38. Reconfiguration process and routing management for service platforms
  39. Scheduling array redistribution with virtual channel support
  40. A case study of Grid Computing and computer algebra: parallel Gröbner Bases and Characteristic Sets
  41. A rhythm-based access control system for secure wellness services
  42. A novel Adaptive Cluster Transformation (ACT)-based intrusion tolerant architecture for hybrid information technology
  43. Panconnectivity of Cartesian product graphs
  44. Efficient search algorithms for RNAi target detection
Search Result: