			Home About us Contact

Heterogeneous Resources (heterogeneous + resource)

Distribution by Scientific Domains

Information Science and Computing	50%

Selected Abstracts

An EasyGrid portal for scheduling system-aware applications on computational Grids

CONCURRENCY AND COMPUTATION: PRACTICE & EXPERIENCE, Issue 6 2006
C. Boeres
Abstract One of the objectives of computational Grids is to offer applications the collective computational power of distributed but typically shared heterogeneous resources. Unfortunately, efficiently harnessing the performance potential of such systems (i.e. how and where applications should execute on the Grid) is a challenging endeavor due principally to the very distributed, shared and heterogeneous nature of the resources involved. A crucial step towards solving this problem is the need to identify both an appropriate scheduling model and scheduling algorithm(s). This paper presents a tool to aid the design and evaluation of scheduling policies suitable for efficient execution of system-aware parallel applications on computational Grids. Copyright © 2005 John Wiley & Sons, Ltd. [source]

From Good Student to Outcast: The Emergence of a Classroom Identity

ETHOS, Issue 2 2004
Stanton Wortham
The process of social identification draws on heterogeneous resources from several levels of explanation. This article illustrates how, by describing the identity development of one student across an academic year in a ninth-grade classroom. Analyses of transcribed classroom conversations show teachers and students drawing on multiple resources as this student goes from being identified as one of many good students to being identified as a disruptive outcast. This case provides a counterexample to simple theories of identity development that do not recognize the multiple, heterogeneous resources involved in social identification. [source]

A tree-based approach to matchmaking algorithms for resource discovery

INTERNATIONAL JOURNAL OF NETWORK MANAGEMENT, Issue 5 2008
Md. Rafiqul Islam
One of the essential operations in a distributed computing is resource discovery. A resource discovery service provides mechanisms to identify the set of resources capable of satisfying the requirements of a job from a large collection of resources. The matchmaking framework provides a reasonable solution to resource management in a distributed environment; it is composed of four important components as classified advertisement (classad), matchmaker protocol, matchmaking algorithm and claiming protocols. Most of the time required to find a resource depends on the performance of the matchmaking algorithms. A distributed environment introduces a large set of heterogeneous resources which is always changing. The matchmaking algorithms should incorporate with this highly changing environment. In this paper we proposed a fast and efficient searching method for matchmaking algorithms which also deals with resource heterogeneity. The proposed approach reduces the searching time to a linear function from a cubic function proposed by R. Raman, M. Livny, and M. Solomon. We discuss briefly the working principles of the method and compare the experimental results of the proposed matchmaking algorithm with those of the existing algorithm. Copyright © 2008 John Wiley & Sons, Ltd. [source]

An extensible modeling framework for dynamic reassignment and rerouting in cooperative airborne operations

NAVAL RESEARCH LOGISTICS: AN INTERNATIONAL JOURNAL, Issue 7 2010
Chase C. Murray
Abstract Unmanned aerial vehicles (UAVs), increasingly vital to the success of military operations, operate in a complex and dynamic environment, sometimes in concert with manned aircraft. We present an extensible modeling framework for the solution to the dynamic resource management (DRM) problem, where airborne resources must be reassigned to time-sensitive tasks in response to changes in battlespace conditions. The DRM problem is characterized by diverse tasks with time windows, heterogeneous resources with fuel- and payload-capacity limitations, and multiple competing objectives. We propose an integer linear programing formulation for this problem, where mathematical feasibility is guaranteed. Although motivated by airborne military operations, the proposed general modeling framework is applicable to a wide array of settings, such as disaster relief operations. Additionally, land- or water-based operations may be modeled within this framework, as well as any combination of manned and unmanned vehicles. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 [source]