[go: up one dir, main page]

Mei et al., 2014 - Google Patents

A resource-aware scheduling algorithm with reduced task duplication on heterogeneous computing systems

Mei et al., 2014

View PDF
Document ID
4439098731203027573
Author
Mei J
Li K
Li K
Publication year
Publication venue
The Journal of Supercomputing

External Links

Snippet

To satisfy the high-performance requirements of application executions, many kinds of task scheduling algorithms have been proposed. Among them, duplication-based scheduling algorithms achieve higher performance compared to others. However, because of their …
Continue reading at www.cs.newpaltz.edu (PDF) (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for programme control, e.g. control unit
    • G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
    • G06F9/46—Multiprogramming arrangements
    • G06F9/48—Programme initiating; Programme switching, e.g. by interrupt
    • G06F9/4806—Task transfer initiation or dispatching
    • G06F9/4843—Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
    • G06F9/4881—Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
    • G06F17/30386—Retrieval requests
    • G06F17/30424—Query processing
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for programme control, e.g. control unit
    • G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
    • G06F9/46—Multiprogramming arrangements
    • G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5061—Partitioning or combining of resources
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
    • G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F15/00—Digital computers in general; Data processing equipment in general
    • G06F15/16—Combinations of two or more digital computers each having at least an arithmetic unit, a programme unit and a register, e.g. for a simultaneous processing of several programmes
    • G06F15/163—Interprocessor communication
    • G06F15/173—Interprocessor communication using an interconnection network, e.g. matrix, shuffle, pyramid, star, snowflake
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G06F17/5009—Computer-aided design using simulation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F8/00—Arrangements for software engineering
    • G06F8/40—Transformations of program code
    • G06F8/41—Compilation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring
    • G06F11/07—Error detection; Error correction; Monitoring responding to the occurence of a fault, e.g. fault tolerance
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N99/00—Subject matter not provided for in other groups of this subclass
    • G06N99/005—Learning machines, i.e. computer in which a programme is changed according to experience gained by the machine itself during a complete run
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F1/00—Details of data-processing equipment not covered by groups G06F3/00 - G06F13/00, e.g. cooling, packaging or power supply specially adapted for computer application

Similar Documents

Publication Publication Date Title
Yang et al. GraphBLAST: A high-performance linear algebra-based graph framework on the GPU
Mei et al. A resource-aware scheduling algorithm with reduced task duplication on heterogeneous computing systems
Bu et al. HaLoop: Efficient iterative data processing on large clusters
Shang et al. Catch the wind: Graph workload balancing on cloud
Jha et al. A tale of two data-intensive paradigms: Applications, abstractions, and architectures
Lin et al. Design patterns for efficient graph algorithms in MapReduce
Mei et al. Energy-aware task scheduling in heterogeneous computing environments
Dai et al. A synthesized heuristic task scheduling algorithm
Stergiou et al. Shortcutting label propagation for distributed connected components
Mei et al. Energy-aware scheduling algorithm with duplication on heterogeneous computing systems
Cid-Fuentes et al. Efficient development of high performance data analytics in Python
Kwon et al. Skewtune in action: Mitigating skew in mapreduce applications
Sakr Processing large-scale graph data: A guide to current technology
Lei et al. CREST: Towards fast speculation of straggler tasks in MapReduce
Tung et al. Efficient query evaluation on distributed graphs with Hadoop environment
Xia et al. GPU-based butterfly counting
Pirova et al. PMORSy: parallel sparse matrix ordering software for fill-in minimization
Sharma et al. New efficient Hadoop scheduler: Generalized particle swarm optimization and simulated annealing‐dominant resource fairness
Alemi et al. CCFinder: using Spark to find clustering coefficient in big graphs
Mohan et al. A review on large scale graph processing using big data based parallel programming models
Vydyanathan et al. Optimizing latency and throughput of application workflows on clusters
Perozzi et al. Scalable graph clustering with parallel approximate PageRank
Fan et al. Improving the load balance of mapreduce operations based on the key distribution of pairs
Henzinger et al. Scheduling large jobs by abstraction refinement
Lo et al. Mining and generating large-scaled social networks via MapReduce