16,239 research outputs found

    A Novel Workload Allocation Strategy for Batch Jobs

    Get PDF
    The distribution of computational tasks across a diverse set of geographically distributed heterogeneous resources is a critical issue in the realisation of true computational grids. Conventionally, workload allocation algorithms are divided into static and dynamic approaches. Whilst dynamic approaches frequently outperform static schemes, they usually require the collection and processing of detailed system information at frequent intervals - a task that can be both time consuming and unreliable in the real-world. This paper introduces a novel workload allocation algorithm for optimally distributing the workload produced by the arrival of batches of jobs. Results show that, for the arrival of batches of jobs, this workload allocation algorithm outperforms other commonly used algorithms in the static case. A hybrid scheduling approach (using this workload allocation algorithm), where information about the speed of computational resources is inferred from previously completed jobs, is then introduced and the efficiency of this approach demonstrated using a real world computational grid. These results are compared to the same workload allocation algorithm used in the static case and it can be seen that this hybrid approach comprehensively outperforms the static approach

    Project portfolio management: capacity allocation, downsizing decisions and sequencing rules.

    Get PDF
    This paper aims to gain insight into capacity allocation, downsizing decisions and sequencing rules when managing a portfolio of projects. By downsizing, we mean reducing the scale or size of a project and thereby changing the project's content. In previous work, we have determined the amount of critical capacity that is optimally allocated to concurrently executed projects with deterministic or stochastic workloads when the impact of downsizing is known. In this paper, we extend this view with the possibility of sequential processing, which implies that a complete order is imposed on the projects. When projects are sequenced instead of executed in parallel, two effects come into play: firstly, unused capacity can be shifted to later projects in the same period; and secondly, reinvestment revenues gain importance because of the differences in realization time of the sequenced projects. When project workloads are known, only the second effect counts; when project workloads are stochastic, however, the project's capacity usage is uncertain so that unused capacity can be shifted to later projects in the same period. In this case, both effects need to be taken into account. In this paper, we determine optimal sequencing rules when the selection and capacity-allocation decisions for a set of projects have already been made. We also consider a combination of parallel and sequential planning and we perform simulation experiments that confirm the appropriateness of our capacity-allocation methods.Project portfolio management; Downsizing; Sequencing;

    Bribeproof mechanisms for two-values domains

    Full text link
    Schummer (Journal of Economic Theory 2000) introduced the concept of bribeproof mechanism which, in a context where monetary transfer between agents is possible, requires that manipulations through bribes are ruled out. Unfortunately, in many domains, the only bribeproof mechanisms are the trivial ones which return a fixed outcome. This work presents one of the few constructions of non-trivial bribeproof mechanisms for these quasi-linear environments. Though the suggested construction applies to rather restricted domains, the results obtained are tight: For several natural problems, the method yields the only possible bribeproof mechanism and no such mechanism is possible on more general domains.Comment: Extended abstract accepted to SAGT 2016. This ArXiv version corrects typos in the proofs of Theorem 7 and Claims 28-29 of prior ArXiv versio

    Distributed data mining in grid computing environments

    Get PDF
    The official published version of this article can be found at the link below.The computing-intensive data mining for inherently Internet-wide distributed data, referred to as Distributed Data Mining (DDM), calls for the support of a powerful Grid with an effective scheduling framework. DDM often shares the computing paradigm of local processing and global synthesizing. It involves every phase of Data Mining (DM) processes, which makes the workflow of DDM very complex and can be modelled only by a Directed Acyclic Graph (DAG) with multiple data entries. Motivated by the need for a practical solution of the Grid scheduling problem for the DDM workflow, this paper proposes a novel two-phase scheduling framework, including External Scheduling and Internal Scheduling, on a two-level Grid architecture (InterGrid, IntraGrid). Currently a DM IntraGrid, named DMGCE (Data Mining Grid Computing Environment), has been developed with a dynamic scheduling framework for competitive DAGs in a heterogeneous computing environment. This system is implemented in an established Multi-Agent System (MAS) environment, in which the reuse of existing DM algorithms is achieved by encapsulating them into agents. Practical classification problems from oil well logging analysis are used to measure the system performance. The detailed experiment procedure and result analysis are also discussed in this paper
    corecore