Repository logo

Publications

Permanent URI for this collection

https://hdl.handle.net/10217/100413

Browse

Browsing Publications by Subject "ad hoc grid"

Now showing 1 - 3 of 3
  • Thumbnail Image
    ItemOpen Access
    Mapping of subtasks with multiple versions in a heterogeneous ad hoc grid environment
    (Colorado State University. Libraries, 2004) Velazco, Jose, author; Sugavanam, Prasanna, author; Sridharan, Jayashree, author; Sousa, J., author; Sendek, David, author; Satyasekaran, Praveen, author; Pichumani, Prakash, author; Penumarthy, Prashanth, author; Kutruff, Andrew,, author; Dussinger, Steve, author; Chindam, Kiran, author; Banka, Tarun, author; Maciejewski, Anthony A., author; Siegel, H. J., author; Shivle, Sameer, author; IEEE Computer Society, publisher
    An ad hoc grid is a heterogeneous computing system composed of mobile devices. The problem studied here is to statically assign resources to the subtasks of an application, which has an execution time constraint, when the resources are oversubscribed. Each subtask has a preferred version, and a secondary version that uses fewer resources. The goal is to assign resources so that the application meets its execution time constraint while minimizing the number of secondary versions used. Five resource allocation heuristics to derive near-optimal solutions to this problem are presented and evaluated.
  • Thumbnail Image
    ItemOpen Access
    Mapping subtasks with multiple versions on an ad hoc grid
    (Colorado State University. Libraries, 2005) Velazco, J., author; Sridharan, J., author; Sousa, J., author; Smith, J., author; Sendek, D., author; Satyasekaran, P., author; Pichumani, P., author; Penumarthy, P., author; Kutruff, A., author; Dussinger, S., author; Chindam, K., author; Banka, T., author; Maciejewski, Anthony, A., author; Siegel, H. J., author; Sugavanam, P., author; Shivle, S., author; Elsevier B.V., publisher
    An ad hoc grid is a heterogeneous computing system composed of mobile devices. Each computing resource is constrained in battery energy. The problem being studied is to assign statically computing resources to the subtasks of an application that has an execution time constraint, when the resources are oversubscribed. All subtasks must be executed; to accommodate this in an oversubscribed environment, each subtask has two versions: the primary or full version, and the secondary or degraded version. The secondary version utilizes only 10%of the resources that the primary version requires, and produces only 10% of the data output for the subsequent children subtasks. Thus, the degraded version (secondary version) represents a reduced capability of lesser overall value, while consuming fewer resources. The goal is to assign resources so that the application meets an execution time constraint and the battery energy constraint while minimizing the number of degraded versions used. Five resource allocation heuristics to derive near-optimal solutions to this problem are presented, evaluated, and compared.
  • Thumbnail Image
    ItemOpen Access
    Static allocation of resources to communicating subtasks in a heterogeneous ad hoc grid environment
    (Colorado State University. Libraries, 2006) Velazco, José, author; Sridharan, Jayashree, author; Sousa, J., author; Sendek, David, author; Saylor, William, author; Satyasekaran, Praveen, author; Pichumani, Prakash, author; Dussinger, Steve, author; Chindam, Kiran, author; Castain, Ralph, author; Banka, Tarun, author; Sugavanam, Prasanna, author; Maciejewski, Anthony A., author; Siegel, H. J., author; Shivle, Sameer, author; Elsevier Inc., publisher
    An ad hoc grid is a heterogeneous computing and communication system that allows a group of mobile devices to accomplish a mission, often in a hostile environment. Energy management is a major concern in ad hoc grids. The problem studied here focuses on statically assigning resources in an ad hoc grid to an application composed of communicating subtasks. The goal of the allocation is to minimize the average percentage of energy consumed by the application to execute across the machines in the ad hoc grid, while meeting an application execution time constraint. This pre-computed allocation is then used when the application is deployed in a mission. Six different heuristic approaches of varying time complexities have been designed and compared via simulations to solve this ad hoc grid allocation problem. Also, a lower bound based on the performance metric has been designed to compare the performance of the heuristics developed.