Results 1 - 10 of 6,505

1 Error-tolerant Resource Allocation and Payment Minimization for Cloud System

by Sheng Di, Cho-li Wang
"... in fine granularity and allocated on demand. We make three contributions in this paper: (1) We formulate a deadline-driven resource allocation problem based on the Cloud environment facilitated with VM resource isolation technology, and also propose a novel solution with polynomial time, which could ..."
Abstract - Cited by 9 (0 self) - Add to MetaCart
in fine granularity and allocated on demand. We make three contributions in this paper: (1) We formulate a deadline-driven resource allocation problem based on the Cloud environment facilitated with VM resource isolation technology, and also propose a novel solution with polynomial time, which

Minimization of Payment and Error Tolerent Resource Allocation for Cloud System

by Sireesha Thulluru, Duvvuru Anil
"... Abstract: Virtual machine (VM) technology being greater and fully developed, compute resources in cloud systems can be partitioned in fine granularity and allocated on demand, which contributes three technologies such as, Formulating a deadline-driven resource allocation problem based on the cloud e ..."
Abstract - Add to MetaCart
Abstract: Virtual machine (VM) technology being greater and fully developed, compute resources in cloud systems can be partitioned in fine granularity and allocated on demand, which contributes three technologies such as, Formulating a deadline-driven resource allocation problem based on the cloud

A Performance Modeling and Optimization of Deadline-Driven Pig Programs

by Zhuoyao Zhang, Ludmila Cherkasova, Hewlett-packard Labs
"... Many applications associated with live business intelligence are written as complex data analysis programs defined by directed acyclic graphs of MapReduce jobs, e.g. using Pig, Hive, or Scope frameworks. An increasing number of these applications have additional requirements for completion time guar ..."
Abstract - Cited by 3 (1 self) - Add to MetaCart
performance modeling environment for Pig programs that automatically profiles jobs from the past runs and aims to solve the following inter-related problems: (i) estimating the completion time of a Pig program as a function of allocated resources; (ii) estimating the amount of resources (a number of map

A Resource Management Architecture for Metacomputing Systems

by Karl Czajkowski , Ian Foster, Nick Karonis, Carl Kesselman, Stuart Martin, Warren Smith, Steven Tuecke , 1997
"... Metacomputing systems are intended to support remote and/or concurrent use of geographically distributed computational resources. Resource management in such systems is complicated by five concerns that do not typically arise in other situations: site autonomy and heterogeneous substrates at the ..."
Abstract - Cited by 462 (45 self) - Add to MetaCart
at the resources, and application requirements for policy extensibility, co-allocation, and online control. We describe a resource management architecture that addresses these concerns. This architecture distributes the resource management problem among distinct local manager, resource broker, and resource co-allocator

A generalized processor sharing approach to flow control in integrated services networks: The single-node case

by Abhay K. Parekh, Robert G. Gallager - IEEE/ACM TRANSACTIONS ON NETWORKING , 1993
"... The problem of allocating network resources to the users of an integrated services network is investigated in the context of rate-based flow control. The network is assumed to be a virtual circuit, connection-based packet network. We show that the use of Generalized processor Sharing (GPS), when co ..."
Abstract - Cited by 2010 (5 self) - Add to MetaCart
The problem of allocating network resources to the users of an integrated services network is investigated in the context of rate-based flow control. The network is assumed to be a virtual circuit, connection-based packet network. We show that the use of Generalized processor Sharing (GPS), when

Matchmaking: Distributed Resource Management for High Throughput Computing

by Rajesh Raman, Miron Livny, Marvin Solomon - In Proceedings of the Seventh IEEE International Symposium on High Performance Distributed Computing , 1998
"... Conventional resource management systems use a system model to describe resources and a centralized scheduler to control their allocation. We argue that this paradigm does not adapt well to distributed systems, particularly those built to support high-throughput computing. Obstacles include heteroge ..."
Abstract - Cited by 435 (20 self) - Add to MetaCart
heterogeneity of resources, which make uniform allocation algorithms difficult to formulate, and distributed ownership, leading to widely varying allocation policies. Faced with these problems, we developed and implemented the classified advertisement (classad) matchmaking framework, a flexible and general

A Transmission Control Scheme for Media Access in Sensor Networks

by Alec Woo, David E. Culler , 2001
"... We study the problem of media access control in the novel regime of sensor networks, where unique application behavior and tight constraints in computation power, storage, energy resources, and radio technology have shaped this design space to be very different from that found in traditional mobile ..."
Abstract - Cited by 481 (11 self) - Add to MetaCart
We study the problem of media access control in the novel regime of sensor networks, where unique application behavior and tight constraints in computation power, storage, energy resources, and radio technology have shaped this design space to be very different from that found in traditional mobile

Deadline-Driven Auctions for NPC Host Allocation in P2P

by Lu Fan, Phil Trinder, Hamish Taylor
"... This paper presents the design, implementation and evaluation of Deadline-Driven Auctions (DDA), a novel task mapping infrastructure for heterogeneous distributed environments. DDA is primarily designed to support the hosting of Non-Player Characters (NPCs) in P2P Massively Multiplayer Online Games ..."
Abstract - Add to MetaCart
This paper presents the design, implementation and evaluation of Deadline-Driven Auctions (DDA), a novel task mapping infrastructure for heterogeneous distributed environments. DDA is primarily designed to support the hosting of Non-Player Characters (NPCs) in P2P Massively Multiplayer Online Games

Proportionate progress: A notion of fairness in resource allocation

by S. K. Baruah, N. K. Cohen, C. G. Plaxton, D. A. Varvel - Algorithmica , 1996
"... Given a set of n tasks and m resources, where each task x has a rational weight x:w = x:e=x:p; 0 < x:w < 1, a periodic schedule is one that allocates a resource to a task x for exactly x:e time units in each interval [x:p k; x:p (k + 1)) for all k 2 N. We de ne a notion of proportionate progre ..."
Abstract - Cited by 322 (25 self) - Add to MetaCart
progress, called P-fairness, and use it to design an e cient algorithm which solves the periodic scheduling problem. Keywords: Euclid's algorithm, fairness, network ow, periodic scheduling, resource allocation.

The HEARSAY-II speech understanding system: Integrating knowledge to resolve uncertainty

by Lee D. Erman, Victor R. Lesser - Computing Surveys , 1980
"... The Hearsay-II system, developed during the DARPA-sponsored five-year speech-understanding research program, represents both a specific solution to the speech-understanding problem and a general framework for coordinating independent processes to achieve cooperative problem-solving behavior. As a co ..."
Abstract - Cited by 392 (23 self) - Add to MetaCart
at various levels of abstraction. In additmn, it allocates hmlted processing resources fwst to the most promising incremental actions. The final configuration of the Hearsay-II system comprises problem-solving components to generate and evaluate speech hypotheses, and a focus-of-control mechanism to identify
Results 1 - 10 of 6,505