Robust processor allocation for independent tasks when dollar cost for processors is a constraint

Includes bibliographical references (pages 9-10).In a distributed heterogeneous computing system, the resources have different capabilities and tasks have different requirements. Different classes of machines used in such systems typically vary in dollar cost based on their computing efficiencies. Makespan (defined as the completion time for an entire set of tasks) is often the performance feature that is optimized. Resource allocation is often done based on estimates of the computation time of each task on each class of machines. Hence, it is important that makespan be robust against errors in computation time estimates. The dollar cost to purchase the machines for use can be a constraint such that only a subset of the machines available can be purchased. The goal of this study is to: (1) select a subset of all the machines available so that the cost constraint for the machines is satisfied, and (2) find a static mapping of tasks so that the robustness of the desired system feature, makespan, is maximized against the errors in task execution time estimates. Six heuristic techniques to this problem are presented and evaluated

and

static allocation of resources for independent tasks under makespa

Synthesis, molecular docking and anti-mycobacterial evaluation of new imidazo1,2-a]pyridine-2-carboxamide derivatives

New anti-tubercular agents, imidazo1,2-a]pyridine-2-carboxamide derivatives (5a-q) have been designed and synthesized. The structural considerations of the designed molecules were further supported by the docking study with a long-chain enoyl-acyl carrier protein reductase (InhA). The chemical structures of the new compounds were characterized by IR, H-1 NMR, C-13 NMR, HRMS and elemental analysis. In addition, single crystal X-ray diffraction has also been recorded for compound 5f. Compounds were evaluated in vitro against Mycobacterium tuberculosis H37Rv, and cytotoxicity against HEK-293T cell line. Amongst the tested compounds 5j, 5l and 5q were emerged as good anti-tubercular agents with low cytotoxicity. The structure-anti TB activity relationship of these derivatives was explained by molecular docking. (C) 2014 Elsevier Masson SAS. All rights reserved

Synthesis, molecular docking, antimycobacterial and antimicrobial evaluation of new pyrrolo3,2-c]pyridine Mannich bases

In this report, we describe the synthesis and biological evaluation of a new series of pyrrolo3,2-c]pyridine Mannich bases (7a-v). The Mannich bases were obtained in good yields by one-pot three component condensation of pyrrolo3,2-c]pyridine scaffold (6a-c) with secondary amines and excess of formaldehyde solution in AcOH. The chemical structures of the compounds were characterized by H-1 NMR, C-13 NMR, LC/MS and elemental analysis. Single crystal X-ray diffraction has been recorded for compound 7k (C23H29ClN4](+2), H2O). The in vitro antimicrobial activities of the compounds were evaluated against various bacterial and fungal strains using Agar diffusion method and Broth micro dilution method. Compounds 7e, 7f, 7r, 7t, and 7u were showed good Gram-positive antibacterial activity against S. aureus, B. flexus, C sporogenes and S. mutans. Furthermore, in vitro antimycobacterial activity was evaluated against Mycobacterium tuberculosis H37Rv (ATCC 27294) using MABA. Compounds 7r, 7t, and 7u were showed good antitubercular activity against Mtb (MIC >= 6.25 g/mL). Among the tested compounds, 14(4-chloro-2-(cyclohexylmethyl)-1H-pyrrolo3,2-clpyridin-3-yl)methyl) piperidine-3-carboxamide (7t) was showed excellent antimycobacterial activity against Mtb (MIC <0.78 mu g/mL) and low cytotoxicity against the HEK-293T cell line (SI 25). Molecular docking of the active compounds against glutamate racemase (Murl) and Mtb glutamine synthetase were explained the structure-activity observed in vitro. (C) 2017 Elsevier Masson SAS. All rights reserved

Robust static allocation of resources for independent tasks under makespan and dollar cost constraints

Includes bibliographical references (pages 413-414).Heterogeneous computing (HC) systems composed of interconnected machines with varied computational capabilities often operate in environments where there may be inaccuracies in the estimation of task execution times. Makespan (defined as the completion time for an entire set of tasks) is often the performance feature that needs to be optimized in such systems. Resource allocation is typically performed based on estimates of the computation time of each task on each class of machines. Hence, it is important that makespan be robust against errors in computation time estimates. In this research, the problem of finding a static mapping of tasks to maximize the robustness of makespan against the errors in task execution time estimates given an overall makespan constraint is studied. Two variations of this basic problem are considered: (1) where there is a given, fixed set of machines, (2) where an HC system is to be constructed from a set of machines within a dollar cost constraint. Six heuristic techniques for each of these variations of the problem are presented and evaluated

Processor allocation for tasks that is robust against errors in computation time estimates

Heterogeneous computing systems composed of interconnected machines with varied computational capabilities often operate in environments where there may be sudden machine failures, higher than expected load, or inaccuracies in estimation of system parameters. Makespan (defined as the completion time for an entire set of tasks) is often the performance feature that is optimized in such systems. It is important that the makespan of a resource allocation (mapping) be robust against errors in task computation time estimates. The problem of optimally mapping tasks onto machines of a heterogeneous computing environment has been shown, in general, to be NP-complete. Therefore, heuristic techniques to find near optimal solutions to this mapping problem are required. The goal of this research is to find a static mapping of tasks so that the robustness of the desired system feature, makespan, is maximized against the errors in task execution time estimates. Seven heuristics to derive near-optimal solutions and an upper bound to this problem are presented and evaluated