Home About us Contact
|
Home About us Contact | ||
|
|
||
Resource Sharing (resource + sharing)
Selected AbstractsThe development of a geospatial data Grid by integrating OGC Web services with Globus-based Grid technologyCONCURRENCY AND COMPUTATION: PRACTICE & EXPERIENCE, Issue 14 2008Liping Di Abstract Geospatial science is the science and art of acquiring, archiving, manipulating, analyzing, communicating, modeling with, and utilizing spatially explicit data for understanding physical, chemical, biological, and social systems on the Earth's surface or near the surface. In order to share distributed geospatial resources and facilitate the interoperability, the Open Geospatial Consortium (OGC), an industry,government,academia consortium, has developed a set of widely accepted Web-based interoperability standards and protocols. Grid is the technology enabling resource sharing and coordinated problem solving in dynamic, multi-institutional virtual organizations. Geospatial Grid is an extension and application of Grid technology in the geospatial discipline. This paper discusses problems associated with directly using Globus-based Grid technology in the geospatial disciplines, the needs for geospatial Grids, and the features of geospatial Grids. Then, the paper presents a research project that develops and deploys a geospatial Grid through integrating Web-based geospatial interoperability standards and technology developed by OGC with Globus-based Grid technology. The geospatial Grid technology developed by this project makes the interoperable, personalized, on-demand data access and services a reality at large geospatial data archives. Such a technology can significantly reduce problems associated with archiving, manipulating, analyzing, and utilizing large volumes of geospatial data at distributed locations. Copyright © 2008 John Wiley & Sons, Ltd. [source] Dynamic data replication in LCG 2008CONCURRENCY AND COMPUTATION: PRACTICE & EXPERIENCE, Issue 11 2008C. Nicholson Abstract To provide performance access to data from high-energy physics experiments such as the Large Hadron Collider (LHC), controlled replication of files among grid sites is required. Dynamic, automated replication in response to jobs may also be useful and has been investigated using the grid simulator OptorSim. In this paper, results are presented from simulations of the LHC Computing Grid in 2008, in a physics analysis scenario. These show, first, that dynamic replication does give improved job throughput; second, that for this complex grid system, simple replication strategies such as Least Recently Used and Least Frequently Used are as effective as more advanced economic models; third, that grid site policies that allow maximum resource sharing are more effective; and lastly, that dynamic replication is particularly effective when data access patterns include some files being accessed more often than others, such as with a Zipf-like distribution. Copyright © 2008 John Wiley & Sons, Ltd. [source] InterGrid: a case for internetworking islands of GridsCONCURRENCY AND COMPUTATION: PRACTICE & EXPERIENCE, Issue 8 2008Marcos Dias de Assunção Abstract Over the last few years, several nations around the world have set up Grids to share resources such as computers, data, and instruments to enable collaborative science, engineering, and business applications. These Grids follow a restricted organizational model wherein a Virtual Organization (VO) is created for a specific collaboration and all interactions such as resource sharing are limited to within the VO. Therefore, dispersed Grid initiatives have led to the creation of disparate Grids with little or no interaction between them. In this paper, we propose a model that: (a) promotes interlinking of islands of Grids through peering arrangements to enable InterGrid resource sharing; (b) provides a scalable structure for Grids that allow them to interconnect with one another and grow in a sustainable way; (c) creates a global Cyberinfrastructure to support e-Science and e-Business applications. This work identifies and proposes architecture, mechanisms, and policies that allow the internetworking of Grids and allows Grids to grow in a similar manner as the Internet. We term the structure resulting from such internetworking between Grids as the InterGrid. The proposed InterGrid architecture is composed of InterGrid Gateways responsible for managing peering arrangements between Grids. We discuss the main components of the architecture and present a research agenda to enable the InterGrid vision. Copyright © 2007 John Wiley & Sons, Ltd. [source] SHARED SERVICES IN AUSTRALIAN LOCAL GOVERNMENT: A CASE STUDY OF THE QUEENSLAND LOCAL GOVERNMENT ASSOCIATION MODELECONOMIC PAPERS: A JOURNAL OF APPLIED ECONOMICS AND POLICY, Issue 4 2008BRIAN DOLLERY Professor of Economics, Director A host of recent public inquiries into Australian local government have recommended increased use of shared services and resource-sharing models between groups of local councils. While little is known about the extent and consequences of service sharing, emphasis has been fixed on ,horizontal' shared service models between different local councils in the same municipal jurisdictions. However, other models of shared services and resource sharing are possible. This paper considers the Queensland Local Government Association (LGAQ) model as a case study of a resource sharing between all councils in a given system of local government. This form of shared service and resource sharing seems to offer excellent prospects for cost savings and capacity enhancement. [source] Improving node behaviour in a QoS control environment by means of load-dependent resource redistributions in LANs,INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, Issue 4 2005Bernd E. Wolfinger Abstract An important means to guarantee an acceptable quality of service in networks with real-time communication requirements is the reservation of resources at connection setup time. However, such reserved resources, e.g. transmission bandwidth, may be unused as a consequence of the variations in the actual resource demands. Therefore, a more efficient resource utilization is possible if communicating stations or end-users dynamically hand over some of the free resources temporarily to the other communication partners, e.g. of a ,broadcast network'. This paper concentrates on two fundamental problems of such a demand-based sharing of resources: on the one hand, estimation of the current resource requirement on the basis of load measurements is investigated and, on the other hand, we elaborate efficient algorithms for resource sharing respecting real-time requirements. The algorithms proposed for load estimation and for resource sharing are evaluated analytically with respect to their efficiency for worst-case, average-case and realistic load scenarios. Our approach suggested for resource and traffic management allows one to achieve significantly better utilization of network resources. Copyright © 2005 John Wiley & Sons, Ltd. [source] Habitat and abundance of Balitoridae in small rivers of central ThailandJOURNAL OF FISH BIOLOGY, Issue 10 2008F. W. H. Beamish Balitorids were collected, by electrofishing, from small rivers across central Thailand between October 2000 and March 2004. Total balitorid abundance for the 18 species averaged 3·8% of the cumulative total for all fishes. Balitorid species numbers and abundance varied directly with elevation to c. 400 m, substratum particle size and ambient silica concentration. Species numbers at stations were modest and few species were widely distributed. Species associations related significantly with elevation, temperature and ambient concentrations of dissolved oxygen and silica. Turbidity was also significant but probably an artefact. Habitat separation clearly occurs among some balitorids, particularly the less common species, and probably represents species-specific direct and indirect habitat effects. The more common balitorid species tended to occur in similar habitats where the significant factors approximated average values. For these species, coexistence is suggested to occur through food resource sharing possibly facilitated through adaptations. Balitorid distributions in low-order rivers are attributed to the direct and indirect influences of the environment on energy available for the performance of essential activities. [source] Early reproductive maturity among Pumé foragers: Implications of a pooled energy model to fast life historiesAMERICAN JOURNAL OF HUMAN BIOLOGY, Issue 4 2009Karen L. Kramer Life history theory places central importance on relationships between ontogeny, reproduction, and mortality. Fast human life histories have been theoretically and empirically associated with high mortality regimes. This relationship, however, poses an unanswered question about energy allocation. In epidemiologically stressful environments, a greater proportion of energy is allocated to immune function. If growth and maintenance are competing energetic expenditures, less energy should be available for growth, and the mechanism to sustain rapid maturation remains unclear. The human pattern of extended juvenile provisioning and resource sharing may provide an important source of variation in energy availability not predicted by tradeoff models that assume independence at weaning. We consider a group of South American foragers to evaluate the effects that pooled energy budgets may have on early reproduction. Despite growing up in an environment with distinct seasonal under-nutrition, harsh epidemiological conditions, and no health care, Pumé girls mature quickly and initiate childbearing in their midteens. Pooled energy budgets compensate for the low productivity of girls not only through direct food transfers but importantly by reducing energy they would otherwise expend in foraging activities to meet metabolic requirements. We suggest that pooled energy budgets affect energy availability at both extrinsic and intrinsic levels. Because energy budgets are pooled, Pumé girls and young women are buffered from environmental downturns and can maximize energy allocated to growth completion and initiate reproduction earlier than a traditional bound-energy model would predict. Am. J. Hum. Biol., 2009. © 2009 Wiley-Liss, Inc. [source] DEADLOCK AVOIDANCE FOR FLEXIBLE MANUFACTURING SYSTEMS WITH CHOICES BASED ON DIGRAPH CIRCUIT ANALYSISASIAN JOURNAL OF CONTROL, Issue 2 2007Wenle Zhang ABSTRACT Due to existence of concurrent part flows and resource sharing in modern automated flexible manufacturing systems (FMS), deadlock is a common problem and its occurrence causes loss of productivity. When a manufacturing system is modeled by a digraph, existence of circuits in such a graph is a necessary condition for deadlock. Our previous work further showed that the knot and order of a circuit is closely related to impending deadlocks , a type of deadlock that is more difficult to detect. In this paper, we extend our previous work on deadlock avoidance for flexible manufacturing systems to allow choices in process flows (a.k.a., flexible part routing). Due to introduction of choices, part flow dynamics become more sophisticated and our previous results are no longer valid. A systematic circuit analysis is performed in this paper. New concepts such as broken circuit, basic circuit, choice circuit and supremal circuit are introduced to reduce significantly the number of circuits thus improving efficiency of our approach. The extended method is highly permissive with the adjusted effective free space calculation to capture more necessary parts flow dynamics, especially when multiple knots exist in the digraph model. The online policy runs in polynomial time once the set of basic circuits of the digraph is computed offline. Simulation results on selected examples are given. [source] SELF-ORGANIZING PEER-TO-PEER SOCIAL NETWORKSCOMPUTATIONAL INTELLIGENCE, Issue 3 2008Fang Wang Peer-to-peer (P2P) systems provide a new solution to distributed information and resource sharing because of its outstanding properties in decentralization, dynamics, flexibility, autonomy, and cooperation, summarized as DDFAC in this paper. After a detailed analysis of the current P2P literature, this paper suggests to better exploit peer social relationships and peer autonomy to achieve efficient P2P structure design. Accordingly, this paper proposes Self-organizing peer-to-peer social networks (SoPPSoNs) to self-organize distributed peers in a decentralized way, in which neuron-like agents following extended Hebbian rules found in the brain activity represent peers to discover useful peer connections. The self-organized networks capture social associations of peers in resource sharing, and hence are called P2P social networks. SoPPSoNs have improved search speed and success rate as peer social networks are correctly formed. This has been verified through tests on real data collected from the Gnutella system. Analysis on the Gnutella data has verified that social associations of peers in reality are directed, asymmetric and weighted, validating the design of SoPPSoN. The tests presented in this paper have also evaluated the scalability of SoPPSoN, its performance under varied initial network connectivity and the effects of different learning rules. [source] | |||||||||||||