[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

Proficz et al., 2021 - Google Patents

Improving Clairvoyant: reduction algorithm resilient to imbalanced process arrival patterns

Proficz et al., 2021

View HTML
Document ID
6597668169777758487
Author
Proficz J
Ocetkiewicz K
Publication year
Publication venue
The Journal of Supercomputing

External Links

Snippet

The Clairvoyant algorithm proposed in “A novel MPI reduction algorithm resilient to imbalances in process arrival times” was analyzed, commented and improved. The comments concern handling certain edge cases in the original pseudocode and description …
Continue reading at link.springer.com (HTML) (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/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
    • 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
    • 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
    • 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/54—Interprogramme communication; Intertask communication
    • 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
    • G06F17/30958—Graphs; Linked lists
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F15/00—Digital computers in general; Data processing equipment in general
    • G06F15/76—Architectures of general purpose stored programme computers
    • G06F15/78—Architectures of general purpose stored programme computers comprising a single central processing unit
    • 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
    • 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
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • 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
    • 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

Similar Documents

Publication Publication Date Title
Zhang et al. GraphP: Reducing communication for PIM-based graph processing with efficient data partition
Zaharia et al. Spark: Cluster computing with working sets
Duarte et al. Parallel variable neighbourhood search strategies for the cutwidth minimization problem
Khoram et al. Accelerating graph analytics by co-optimizing storage and access on an FPGA-HMC platform
Feldmann et al. F1: A fast and programmable accelerator for fully homomorphic encryption (extended version)
Stefan et al. Can one-chip parallel computing be liberated from ad hoc solutions? A computation model based approach and its implementation
Ying et al. Bluefog: Make decentralized algorithms practical for optimization and deep learning
Mei et al. A resource-aware scheduling algorithm with reduced task duplication on heterogeneous computing systems
Guo et al. Modeling, analysis, and experimental comparison of streaming graph-partitioning policies
Shahrouz et al. gim: Gpu accelerated ris-based influence maximization algorithm
Gulisano et al. Stretch: Virtual shared-nothing parallelism for scalable and elastic stream processing
Fioretto et al. Accelerating exact and approximate inference for (distributed) discrete optimization with GPUs
Wan et al. TESLAC: accelerating lattice-based cryptography with AI accelerator
Najdataei et al. Stretch: Scalable and elastic deterministic streaming analysis with virtual shared-nothing parallelism
Kang et al. The processing-in-memory model
Kalnis et al. Mizan: Optimizing graph mining in large parallel systems
Proficz Improving all-reduce collective operations for imbalanced process arrival patterns
Proficz et al. Improving Clairvoyant: reduction algorithm resilient to imbalanced process arrival patterns
Fioretto et al. Exploiting GPUs in solving (distributed) constraint optimization problems with dynamic programming
Lee et al. SearchaStore: Fast and secure searchable cloud services
Mohan et al. A review on large scale graph processing using big data based parallel programming models
Lo et al. Mining and generating large-scaled social networks via MapReduce
Ma et al. F2M: Scalable field-aware factorization machines
Coll Ruiz et al. s6raph: vertex-centric graph processing framework with functional interface
Sattar Scalable community detection using distributed louvain algorithm