1557616
Optimizing Grid Scheduling Based on Local Cluster Scheduling Policies and Resource Availability
on the common paradigm of treating clusters as separate administrative domains. Clusters are grouped to form grids which participate in Virtual Organizations (VO) and share resources to meet common computing goals. Each cluster is a separate administrative domain and can choose to be a part of many VOs. Because of the nature of a VO, a cluster typically gives a higher preference to scheduling jobs for one VO over other VOs. In this paper we present a grid scheduling architecture which takes into consideration the current resource availability and scheduling policies of clusters at various sites. This architecture considers both hardware and software resources. The primary goal of this scheduler is to reduce the completion time of jobs by reducing the queuing time of jobs, also providing an increase in CPU utilization. We show the effect of our scheduling technique using a prototype implementation and compare the results against a typical grid scheduler based on random allocation of resources.
10614369
PICO: A Middleware Framework for Pervasive Computing
The pervasive information community organization is a framework for creating mission-oriented dynamic communities of autonomous software entities that perform tasks for users and devices. PICO's telemedicine example scenario demonstrates its potential as a simple, unique, and versatile middleware framework for pervasive computing.
29185449
Performance Analysis and Scalability of the ThreadmanTM Thread Manager
11624555
A Query Algebra for Fragmented XML Stream Data
The increased usage of mobile devices coupled with an unprecedented demand for information has pushed the scalability problem of pull-based data service to the focus. A broadcast model of streaming data over a wireless medium has been proposed as a viable alternative for information dissemination. In the streaming broadcast model, servers broadcast data in an asynchronous and unacknowledged mode while clients process personalized and complex queries locally, relieving the load on the server. We address the query processing of streamed XML data, which is fragmented into manageable chunks for easier synchronization. Although there has been some work done in defining algebras that model XQueries on XML documents, no work has been done in defining query algebras for fragmented XML stream data. We define a model for processing fragmented XML stream data, using the concept of holes and fillers. This model offers the flexibility required by the server to disseminate data in manageable fragments, whenever they become available, and to send repetitions, replacements and removal of fragments. We then present a query algebra for XQuery that operates on this streamed XML data model. The XML fragments are operated upon in a continuous pipelined fashion without the need of materializing the transmitted document at the client site.
6061688
Mobile Agent Connection Establishment and Management (CEMA)—Message Exchange for Pervasive Computing Environments
Pervasive computing is an emerging technology that offers new possibilities to distributed computing and computer networking; it employs a wide variety of smart, ubiquitous devices throughout an individual's working and living environment. Mobile agents are software entities that can migrate between servers (mobile agent environments) of the network accomplishing various tasks on the behalf of their owners. The objective of this paper is to describe a test and prototyping environment for experimenting with mobile agents in pervasive environments. A prototype environment for a novel, proactive infrastructure is described for mobile agent assisted pervasive computing. In addition, a new message passing algorithm is provided for mobile agent connection establishment and management (CEMA). Simulation results show the performance of the proposed approach.
6748545
Quality of Service Primitives for Operating System Support of Multimedia Applications
15239156
Application of a hybrid genetic algorithm to airline crew scheduling
This paper discusses the development and application of a hybrid genetic algorithm to airline crew scheduling problems. The hybrid algorithm consists of a steady-state genetic algorithm and a local search heuristic. The hybrid algorithm was tested on a set of 40 real-world problems. It found the optimal solution for half the problems, and good solutions for 9 others. The results were compared to those obtained with branch-and-cut and branch-and-bound algorithms. The branch-and-cut algorithm was significantly more successful than the hybrid algorithm, and the branch-and-bound algorithm slightly better.
207225786
Genetic Algorithms: A Practitioner's View
The feature article by Colin Reeves provides a useful introduction to genetic algorithms (GAs) for the operations researcher. In this commentary, I will elaborate on several of Reeves' points and introduce some others. My experience with GAs is as a practitioner and software developer, and it is from this perspective that I will comment on Reeves' article.
24464091
Contours of constructive hypertexts
Discussion of hypertext rhetoric and criticism has foeused on small, freed hypertext that am typically used by casual readers for comparatively short periods. Here we explo~ complex, constructive hypertext, intended to inform and to infIuence dedicated and thoughtful readers. Recurrence and multivalence, both deplored in small hypertext, prove from study of mom complex texts to be very valuable. While static, graph-theoretic measures facilitate understanding of Ioeal hypertext structure, the structures of meaning or contours we observe in current hypertext fiction and scholarship do not appear to reside in static structures, but rather in the complex and dynamic perceptions of the engagedreader.
35397691
Accomplishing More by Doing Less - Lessons from Spanish Language Instruction
29157947
Massively parallel computation of conservation laws
Abstract We present a new method for computing solutions of conservation laws based on the use of cellular automata with the method of characteristics. The method exploits the high degree of parallelism available with cellular automata and retains important features of the method of characteristics. It yields high numerical accuracy and extends naturally to adaptive meshes and domain decomposition methods for perturbed conservation laws. We describe the method and its implementation for a Dirichlet problem with a single conservation law for the one-dimensional case. Numerical results for the one-dimensional law with the classical Burgers nonlinearity or the Buckley-Leverett equation show good numerical accuracy outside the neighborhood of the shocks. The error in the area of the shocks is of the order of the mesh size. The algorithm is well suited for execution on both massively parallel computers and vector machines. We present timing results for an Alliant FX/8, Connection Machine Model 2, and CRAY X-MP.