[
    {
        "id": "osp-13352",
        "type": "article-journal",
        "title": "A Multi-Step Approach for Scheduling Tasks with Synchronization on Clusters of Computers",
        "author": [
            {
                "family": "Arafeh",
                "given": "Bassel R."
            }
        ],
        "URL": "https://omanscience.com/ar/articles/a-multi-step-approach-for-scheduling-tasks-with-synchronization-on-clusters-of-computers",
        "language": "en",
        "issued": {
            "date-parts": [
                [
                    2005
                ]
            ]
        },
        "container-title": "The Journal of Engineering Research",
        "volume": "2",
        "issue": "1",
        "page": "77",
        "DOI": "10.24200/tjer.vol2iss1pp77-89",
        "publisher": "Sultan Qaboos University",
        "ISSN": "1726-6009",
        "abstract": "In this work, a two-step approach is adopted for scheduling tasks with synchronous inter-task communication. To that end, an efficient algorithm, called GLB-Synch, is introduced for mapping clusters and ordering tasks on processors. The algorithm used the information obtained during the clustering step for selecting a cluster to be mapped on the least loaded processor. A performance study has been conducted on the GLB-Synch algorithm by simulation. A multi-step scheduling setup has been performed based on a previously developed algorithm for clustering DAGs with synchronous communication, called NLC-SynchCom, and using synthesized DAGs. We have shown by analysis and experimentation that the GLB-Synch algorithm retains the same low complexity cost of the first step for clustering. The performance results highlight the drawback of synchronization on speedup scalability."
    }
]