• DocumentCode
    1784597
  • Title

    A Task Assignment Method for Phi Structure

  • Author

    Yunchun Li ; Tianyu Zhang

  • Author_Institution
    Comput. Sci. Dept., Beihang Univ., Beijing, China
  • fYear
    2014
  • fDate
    24-27 Nov. 2014
  • Firstpage
    38
  • Lastpage
    41
  • Abstract
    Xeon Phi is a high performance co-processor launched by Intel in 2012. Though Phi is specifically designed for Exascale super computer, the task assignment for Phi is yet to be studied. Based on the special needs of task assignment for Phi, this paper presents an algorithm evolved from graph bisection algorithm: a graph is formed based on the memory dependence of tasks, by traversal the graph with an assuming cut point, iteratively finds out the groups of tasks with least dependence on tasks outside group, this algorithm can provide a task assignment solution between CPU and Phi aiming at memory optimization. Experiment reveals that this algorithm can significantly reduce the total memory usage of the job, also increase the efficiency of the execution. By reducing the memory usage, this algorithm can eliminates the memory bottleneck of Phi and expand the using range of Phi.
  • Keywords
    coprocessors; graph theory; optimisation; parallel processing; Xeon Phi; graph bisection algorithm; high performance coprocessor; memory optimization; task assignment method; task memory dependence; Algorithm design and analysis; Central Processing Unit; Computational modeling; Distributed computing; Heuristic algorithms; Memory management; Microwave integrated circuits; CG Algorithm; Memory Usage; Phi; Task Assignment;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Distributed Computing and Applications to Business, Engineering and Science (DCABES), 2014 13th International Symposium on
  • Conference_Location
    Xian Ning
  • Print_ISBN
    978-1-4799-4170-4
  • Type

    conf

  • DOI
    10.1109/DCABES.2014.11
  • Filename
    6999052