The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Indexing play an indispensable role in Search Engine. Indexing empower ease of mining of data and lessen the latency of searching a term in huge documents. In this paper, we propose a methodology to index documents in a parallel - distributed manner. Define Metadata structure of a document for indexing; from the metadata, the occurrence of a word shall be ascertained by document wise, page number...
This work considers systems with inactivity periods of unknown duration. We study the question of scheduling ??waking up?? instants in which a server can check whether the inactivity period is over. There is a cost proportional to the delay from the moment the inactivity period ends until the server discovers it, a (small) running cost while the server is away and also a cost for waking up. As an...
We propose a new extension for index based scheduling rules which adds a global system perspective by estimating how much a job could benefit from an immediate processing. We implement this criterion in the ATC rule and compare the performances of the standard ATC and the extended rule ATCG. It is shown that ATCG performs better than ATC, especially when system loads are high and processing times...
The opportunistic computing paradigm is extremely valuable to modern technical and scientific endeavors, as it can support the demand for large and steady amounts of computing capacity. The applications of opportunistic computing environments often require independent and intensive processing over different data sets, characterizing themselves as BoT applications. Opportunistic computing systems,...
To ensure Quality of Service (QoS) for data centers, it is critical to enforce a fair share of storage resources between competing users. Interposed schedulers are one of the most practical methods for performance isolation. Most fair queuing-based proportional sharing algorithms for existing interposed scheduler are variants of counterparts designed for network routers and may result in breaking...
Multimedia applications are often characterised by implicit temporal constraints but, in many cases, they are not programmed using any specialised real-time API. These ??Legacy applications?? have no way to communicate their temporal constraints to the OS kernel, and their quality of service (QoS), being necessarily linked to the temporal behaviour, fails to satisfy acceptable standards. In this paper...
In this paper, we study the impact of task reallocations/migrations on a grid platform, composed of parallel resources, each supervised by a batch scheduler. Results of simulations using real life traces show that gains of 40% can be attained on the average waiting time of jobs even if tasks are initially mapped by a meta-scheduler on the cluster giving the best completion time.
We consider variations of a problem in which data must be delivered to mobile clients en-route, as they travel towards their destinations. The data can only be delivered to the mobile clients as they pass within range of wireless base stations. Example scenarios include the delivery of building maps to firefighters responding to multiple alarms, and the in-transit ldquoilluminationrdquo of simultaneous...
Analyzing and managing large amounts of unstructured information is a high priority task for many companies. For implementing content management solutions, companies need a comprehensive view of their unstructured data. In order to provide a new level of intelligence and control over data resident within the enterprise, one needs to build a chain of tools and automated processes that enable the evaluation,...
Business workflows implemented as BPEL processes play an important role for many business applications. BPEL is used to orchestrate a series of Web service calls. Which provider is used for a specific Web service request is statically defined as endpoint of a Web service call within the BPEL code. If a Web service is offered by more than one provider an intelligent choice of a Web service provider...
Quickly acquiring the data required from network node environments to share files in the vast P2P network environment is a challenging job. Many researches have proposed data sharing mechanisms and scheduling methods in P2P environments, however, most focused on the efficient utilization of network bandwidth, using greedy methods to deliver the data to the client end as early as possible. However,...
With the increasing prevalence of large scale cloud computing environments, how to place requested applications into available computing servers regarding to energy consumption has become an essential research problem, but existing application placement approaches are still not effective for live applications with dynamic characters. In this paper, we proposed a novel approach named EnaCloud, which...
Modern data centers use virtual machine based implementation for numerous advantages like resource isolation, hardware utilization, security and easy management. Applications are generally hosted on different virtual machines on a same physical machine. Virtual machine monitor like Xen is a popular tool to manage virtual machines by scheduling them to use resources such as CPU, memory and network...
We consider a self-managing, self-organizing pool of virtualized computer servers that provides infrastructure as a service (IaaS) for enterprise computing workloads. A global controller automatically manages the pool in a top down manner by periodically varying the number of servers used and re-assigning workloads to different servers. It aims to use as few servers as possible to minimize power usage...
We consider a system consisting of N parallel queues, served by one server. Time is slotted, and the server serves one of the queues in each time slot, according to some scheduling policy. In the first part of the paper, we characterize the buffer overflow exponents and the likeliest overflow trajectories under the Longest Queue First (LQF) scheduling policy. Under statistically identical arrivals...
Fair-share scheduling attempts to grant access to a resource based on the amount of ??share?? that a task possesses. It is widely used in places such as Internet routing, and recently, in the Linux kernel. Software performance engineering is concerned with creating responsive applications and often uses modeling to predict the behaviour of a system before the system is built. This work extends the...
To solve the bottleneck problem of tasks that the interdependence between tasks fails to consider during the course of resource assignment and task scheduling based on the heuristics algorithm, a grid resource's domain split assignment method (GR-DSAM) is presented, which based on association rule model to group the sub-tasks. First, in order to enhance the sub-tasks' relationship of the same sub-task-group...
In this paper, a P2P volunteer computing system, PPVC, is presented. Volunteers are organized as a P2P network, i.e. there is no central server and every volunteer has the same function. It uses a decentralized job scheduling method so that each volunteer only need to communicate with its direct neighbors but an application is able to be distributed to all the volunteers. Using this job scheduling...
Patching is a cost efficient multicast stream scheduling technique to provide true VOD services. However, one patching channel is dedicated for serving one client and can't be shared by others. Therefore, the duration of patching streams is decisive to the performance of patching. When request rate is high, the scalability of patching is poor. In this paper, we present an adaptive segment-based patching...
It has been observed in recent years that in many applications service time demands are highly variable. Without foreknowledge of exact service times of individual jobs, processor sharing is an effective theoretical strategy for handling such demands. In practice, however, processor sharing must be implemented by time-slicing with a round-robin discipline. In this paper, we investigate how round-robin...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.