Subdividing Long-Running, Variable-Length Analyses Into Short, Fixed-Length BOINC Workunits

被引:7
|
作者
Bazinet, Adam L. [1 ]
Cummings, Michael P. [1 ]
机构
[1] Univ Maryland, Biomol Sci Bldg, College Pk, MD 20742 USA
基金
美国国家科学基金会;
关键词
BOINC; Volunteer computing; Grid computing; Scheduling; Checkpointing; GARLI; Phylogenetics; Maximum likelihood; MOTHS;
D O I
10.1007/s10723-015-9348-5
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We describe a scheme for subdividing long-running, variable-length analyses into short, fixed-length boinc workunits using phylogenetic analyses as an example. Fixed-length workunits decrease variance in analysis runtime, improve overall system throughput, and make boinc a more useful resource for analyses that require a relatively fast turnaround time, such as the phylogenetic analyses submitted by users of the garli web service at molecularevolution.org. Additionally, we explain why these changes will benefit volunteers who contribute their processing power to boinc projects, such as the Lattice boinc Project (boinc.umiacs.umd.edu). Our results, which demonstrate the advantages of relatively short workunits, should be of general interest to anyone who develops and deploys an application on the boinc platform.
引用
收藏
页码:429 / 441
页数:13
相关论文
共 50 条
  • [1] Subdividing Long-Running, Variable-Length Analyses Into Short, Fixed-Length BOINC Workunits
    Adam L. Bazinet
    Michael P. Cummings
    Journal of Grid Computing, 2016, 14 : 429 - 441
  • [2] TEXT COMPRESSION USING VARIABLE-LENGTH TO FIXED-LENGTH ENCODINGS
    COOPER, D
    LYNCH, MF
    JOURNAL OF THE AMERICAN SOCIETY FOR INFORMATION SCIENCE, 1982, 33 (01): : 18 - 31
  • [3] Constructing Variable-Length PRPs and SPRPs from Fixed-Length PRPs
    Cook, Debra L.
    Yung, Moti
    Keromytis, Angelos
    INFORMATION SECURITY AND CRYPTOLOGY, 2009, 5487 : 157 - +
  • [4] Class of easily implementable fixed-length to variable-length balanced binary line codes
    da Rocha, V. C.
    de Lemos-Neto, J. S.
    Pacheco, A. F.
    ELECTRONICS LETTERS, 2019, 55 (05) : 266 - 267
  • [5] VARIABLE-LENGTH VERSUS FIXED-LENGTH CODING: ON TRADEOFFS FOR SOFT-DECISION DECODING
    Han, Sai
    Fingscheidt, Tim
    2014 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP), 2014,
  • [6] Codec design for variable-length to fixed-length data conversion for H.263
    Wang, Chua-Chin
    Sung, Gang-Neng
    Li, Jia-Hao
    IIH-MSP: 2006 INTERNATIONAL CONFERENCE ON INTELLIGENT INFORMATION HIDING AND MULTIMEDIA SIGNAL PROCESSING, PROCEEDINGS, 2006, : 483 - +
  • [7] Bridge the gap between fixed-length and variable-length evolutionary neural architecture search algorithms
    Gong, Yunhong
    Sun, Yanan
    Peng, Dezhong
    Chen, Xiangru
    ELECTRONIC RESEARCH ARCHIVE, 2024, 32 (01): : 263 - 292
  • [9] Fixed-length switching vs. variable-length switching in input-queued IP switches
    Hu, CC
    Chen, XF
    Li, WJ
    Liu, B
    2004 IEEE WORKSHOP ON IP OPERATIONS AND MANAGEMENT PROCEEDINGS (IPOM 2004): SELF-MEASUREMENT & SELF-MANAGEMENT OF IP NETWORKS & SERVICES, 2004, : 117 - 122
  • [10] VARIABLE TO FIXED-LENGTH CODES FOR MARKOV SOURCES
    TJALKENS, TJ
    WILLEMS, FMJ
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1987, 33 (02) : 246 - 257