Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
546
Ceph: A scalable, highperformance distributed system,” in OSDI,
, 2006
"... Abstract We have developed Ceph, a distributed file system that provides excellent performance, reliability, and scalability. Ceph maximizes the separation between data and metadata management by replacing allocation tables with a pseudo-random data distribution function (CRUSH) designed for hetero ..."
Abstract
-
Cited by 275 (32 self)
- Add to MetaCart
Abstract We have developed Ceph, a distributed file system that provides excellent performance, reliability, and scalability. Ceph maximizes the separation between data and metadata management by replacing allocation tables with a pseudo-random data distribution function (CRUSH) designed
Exploiting platform heterogeneity for power efficient data centers
- In Proceedings of the IEEE International Conference on Autonomic Computing (ICAC
, 2007
"... It has recently become clear that power management is of critical importance in modern enterprise computing environments. The traditional drive for higher performance has influenced trends towards consolidation and higher densities, artifacts enabled by virtualization and new small form factor serve ..."
Abstract
-
Cited by 57 (4 self)
- Add to MetaCart
fundamental characteristic of data centers: “platform heterogeneity”. This heterogeneity stems from the architectural and management-capability variations of the underlying platforms. We define an intelligent workload allocation method that leverages heterogeneity characteristics and efficiently maps
An Incremental Memory Allocation Method for Mixed Workloads
- Information Systems Journal
, 1996
"... This paper proposes and investigates an incremental memory allocation method for mixed database workloads of simple hash-join queries and short read transactions. Traditionally, a DBMS allocates all memory reserved for a query at the beginning of the query execution. However, there may be a prolonge ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
This paper proposes and investigates an incremental memory allocation method for mixed database workloads of simple hash-join queries and short read transactions. Traditionally, a DBMS allocates all memory reserved for a query at the beginning of the query execution. However, there may be a
Managing Operational Business Intelligence Workloads ∗
"... We explore how to manage database workloads that contain a mixture of OLTP-like queries that run for milliseconds as well as business intelligence queries and maintenance tasks that last for hours. As data warehouses grow in size to petabytes and complex analytic queries play a greater role in day-t ..."
Abstract
- Add to MetaCart
We explore how to manage database workloads that contain a mixture of OLTP-like queries that run for milliseconds as well as business intelligence queries and maintenance tasks that last for hours. As data warehouses grow in size to petabytes and complex analytic queries play a greater role in day
Query Workload-based RDF Graph Fragmentation and Allocation
"... ABSTRACT As the volume of the RDF data becomes increasingly large, it is essential for us to design a distributed database system to manage it. For distributed RDF data design, it is quite common to partition the RDF data into some parts, called fragments, which are then distributed. Thus, the dist ..."
Abstract
- Add to MetaCart
, the distribution design consists of two steps: fragmentation and allocation. In this paper, we propose a method to explore the intrinsic similarities among the structures of queries in a workload for fragmentation and allocation, which aims to reduce the number of crossing matches and the communication cost during
Dynamic Resource Allocation of Computer Clusters With Probabilistic Workloads
"... In many parallel processing systems, particularly real-time systems, it is desirable for jobs to finish as close to a target time as possible. This work examines a method of controlling the variance of job completion times by dynamically allocating resources to jobs that are behind schedule and taki ..."
Abstract
- Add to MetaCart
In many parallel processing systems, particularly real-time systems, it is desirable for jobs to finish as close to a target time as possible. This work examines a method of controlling the variance of job completion times by dynamically allocating resources to jobs that are behind schedule
Modeling Capabilities and Workload in Intelligent Agents for Simulating Teamwork
- Proceedings of the Twenty-Fourth Annual Conference of the Cognitive Science Society (CogSci'02
"... The ability of members on a team to reason about each others' capabilities and workload is important for effective teamwork. This is required for proper task allocation and load balancing, as well as many other team processes such as adaptivehess, proactive assistance, and backing-up behavior. ..."
Abstract
-
Cited by 3 (0 self)
- Add to MetaCart
The ability of members on a team to reason about each others' capabilities and workload is important for effective teamwork. This is required for proper task allocation and load balancing, as well as many other team processes such as adaptivehess, proactive assistance, and backing-up behavior
Fairness and Load Balancing in Wireless LANs Using Association Control
"... Recent studies on operational wireless LANs (WLANs) have shown that the traffic load is often unevenly distributed among the access points (APs). Such load imbalance results in unfair bandwidth allocation among users. We argue that the load imbalance and consequent unfair bandwidth allocation can ..."
Abstract
-
Cited by 157 (3 self)
- Add to MetaCart
be greatly alleviated by intelligently associating users to APs, termed association control, rather than having users associate with the APs of strongest signal strength. In this paper, we present an efficient algorithmic solution to determine the user-AP associations for max-min fair bandwidth allocation
Dynamic provisioning of multi-tier internet applications
- in Autonomic Computing, 2005. ICAC 2005. Proceedings. Second International Conference on, 2005
"... Dynamic capacity provisioning is a useful technique for handling the multi-time-scale variations seen in Internet workloads. In this paper, we propose a novel dynamic pro-visioning technique for multi-tier Internet applications that employs (i) a flexible queuing model to determine how much resource ..."
Abstract
-
Cited by 140 (9 self)
- Add to MetaCart
resources to allocate to each tier of the application, and (ii) a combination of predictive and reactive methods that deter-mine when to provision these resources, both at large and small time scales. Our experiments on a forty-machine Linux-based hosting platform demonstrate the responsiveness of our
Capacity Planning With Phased Workloads
- In Proceedings of the First Workshop on Software and Performance (WOSP’98
, 1998
"... At the heart of any configuration or capacity planning algorithm for storage systems, there lies a "what if" question: given a device and a set of workloads accessing data on the device, will the quality of service requirement for each workload be satisfied? This is, in general, a hard que ..."
Abstract
-
Cited by 19 (3 self)
- Add to MetaCart
question to answer because of the complexity of workloads in real life. In this paper, we consider QoS bounds on the 95th percentile of response time and demonstrate an approximate method to verify that the QoS requirement is satisfied for a complex and fairly general set of workloads, including workloads
Results 1 - 10
of
546
