Journal article Open Access

Design and implementation of GXP make — A workflow system based on make

Taura, Kenjiro; Matsuzaki, Takuya; Miwa, Makoto; Kamoshida, Yoshikazu; Yokoyama, Daisaku; Dun, Nan; Shibata, Takeshi; Jun, Choi Sung; Tsujii, Jun'ichi

DataCite XML Export

<?xml version='1.0' encoding='utf-8'?>
<resource xmlns:xsi="" xmlns="" xsi:schemaLocation="">
  <identifier identifierType="URL"></identifier>
      <creatorName>Taura, Kenjiro</creatorName>
      <creatorName>Matsuzaki, Takuya</creatorName>
      <creatorName>Miwa, Makoto</creatorName>
      <creatorName>Kamoshida, Yoshikazu</creatorName>
      <creatorName>Yokoyama, Daisaku</creatorName>
      <creatorName>Dun, Nan</creatorName>
      <creatorName>Shibata, Takeshi</creatorName>
      <creatorName>Jun, Choi Sung</creatorName>
      <givenName>Choi Sung</givenName>
      <creatorName>Tsujii, Jun'ichi</creatorName>
    <title>Design and implementation of GXP make — A workflow system based on make</title>
    <date dateType="Issued">2013-02-01</date>
  <resourceType resourceTypeGeneral="Text">Journal article</resourceType>
    <alternateIdentifier alternateIdentifierType="url"></alternateIdentifier>
    <relatedIdentifier relatedIdentifierType="DOI" relationType="IsIdenticalTo">10.1016/j.future.2011.05.026</relatedIdentifier>
    <rights rightsURI="">Creative Commons Attribution Share Alike 4.0 International</rights>
    <rights rightsURI="info:eu-repo/semantics/openAccess">Open Access</rights>
    <description descriptionType="Abstract">This paper describes the rational behind designing
workflow systems based on the Unix make by showing a number
of idioms useful for workflows comprising many tasks. It also
demonstrates a specific design and implementation of such a
workflow system called GXP make. GXP make supports all
the features of GNU make and extends its platforms from
single node systems to clusters, clouds, supercomputers, and
distributed systems. Interestingly, it is achieved by a very small
code base that does not modify GNU make implementation at
all. While being not ideal for performance, it achieved a useful
performance and scalability of dispatching one million tasks in
approximately 16,000 seconds (60 tasks per second, including
dependence analysis) on an 8 core Intel Nehalem node. For
real applications, recognition and classification of protein-protein
interactions from biomedical texts on a supercomputer with more
than 8,000 cores are described.</description>
Views 25
Downloads 8
Data volume 6.7 MB
Unique views 25
Unique downloads 7


Cite as