Results 1 - 10
of
83
Dynamic load distribution in the borealis stream processor
- In ICDE
, 2005
"... Distributed and parallel computing environments are becoming cheap and commonplace. The availability of large numbers of CPU’s makes it possible to process more data at higher speeds. Stream-processing systems are also becoming more important, as broad classes of applications require results in real ..."
Abstract
-
Cited by 67 (5 self)
- Add to MetaCart
in real-time. Since load can vary in unpredictable ways, exploiting the abundant processor cycles requires effective dynamic load distribution techniques. Although load distribution has been extensively studied for the traditional pull-based systems, it has not yet been fully studied in the context
A Distributed Catalog for the Borealis Stream Processing Engine
, 2006
"... The Borealis stream processing engine distributes a network of queries over multiple computers. A Distributed Catalog was developed to capture the topology of the query diagram and it’s deployment over the computer network. A Borealis network may consist of many processing nodes distributed over a w ..."
Abstract
- Add to MetaCart
The Borealis stream processing engine distributes a network of queries over multiple computers. A Distributed Catalog was developed to capture the topology of the query diagram and it’s deployment over the computer network. A Borealis network may consist of many processing nodes distributed over a
Staying FIT: Efficient Load Shedding Techniques for Distributed Stream Processing
- In VLDB
, 2007
"... In distributed stream processing environments, large numbers of continuous queries are distributed onto multiple servers. When one or more of these servers become overloaded due to bursty data arrival, excessive load needs to be shed in order to preserve low latency for the query results. Because of ..."
Abstract
-
Cited by 37 (1 self)
- Add to MetaCart
In distributed stream processing environments, large numbers of continuous queries are distributed onto multiple servers. When one or more of these servers become overloaded due to bursty data arrival, excessive load needs to be shed in order to preserve low latency for the query results. Because
Load Shedding Techniques for Data Stream Management Systems
"... In recent years, we have witnessed the emergence of a new class of applications that must deal with large volumes of streaming data. Examples include financial data analysis on feeds of stock tick-ers, sensor-based environmental monitoring, and network traffic monitoring. Traditional database manage ..."
Abstract
-
Cited by 4 (0 self)
- Add to MetaCart
scal-ability and fault tolerance, we have recently extended Aurora into Borealis- a larger-scale system that can operate in distributed environments. In such an environment, the load shedding problem involves simultaneously removing excess load from multiple overloaded nodes in a scalable fashion
Dealing with Overload in Distributed Stream Processing Systems
- In IEEE International Workshop on Networking Meets Databases (NetDB’06
, 2006
"... Overload management has been an important problem for large-scale dynamic systems. In this paper, we study this problem in the context of our Borealis distributed stream processing system. We show that server nodes must coordinate in their load shedding decisions to achieve global control on output ..."
Abstract
-
Cited by 5 (1 self)
- Add to MetaCart
Overload management has been an important problem for large-scale dynamic systems. In this paper, we study this problem in the context of our Borealis distributed stream processing system. We show that server nodes must coordinate in their load shedding decisions to achieve global control on output
Load Balancing and Density Dependent Jump Markov Processes (Extended Abstract)
- In Proceedings of the 37th IEEE Symposium on Foundations of Computer Science
, 1996
"... Michael Mitzenmacher Department of Computer Science U.C. Berkeley Berkeley, CA 94720 mitzen@cs.berkeley.edu Abstract We provide a new approach for analyzing both static and dynamic randomized load balancing strategies. We demonstrate the approach by providing the first analysis of the following ..."
Abstract
- Add to MetaCart
Michael Mitzenmacher Department of Computer Science U.C. Berkeley Berkeley, CA 94720 mitzen@cs.berkeley.edu Abstract We provide a new approach for analyzing both static and dynamic randomized load balancing strategies. We demonstrate the approach by providing the first analysis of the following
Load balancing for cellular/WLAN integrated networks
- IEEE Network
, 2007
"... Abstract The interworking between heterogeneous third-generation cellular networks and wireless local area networks is one promising evolution approach to fourth-generation wireless networks, which can exploit the complementary advantages of the cellular network and WLANs. Resource management for t ..."
Abstract
-
Cited by 18 (4 self)
- Add to MetaCart
the pooled resources of the network. A two-phase control strategy is adopted in the load balancing policies, in which call assignment is used to provide a statistical quality of service guarantee during the admission phase, and dynamic vertical handoff during the traffic service phase is used to minimize
Transactions on Parallel and Distributed Systems
"... (MMOGs) can include millions of concurrent players spread across the world and interacting with each other within a single session. Faced with high resource demand variability and with misfit resource renting policies, the current industry practice is to over-provision for each game tens of self-own ..."
Abstract
- Add to MetaCart
types of player interaction a source of short-term load variability, which complements the long-term load variability due to the size of the player population. Then, we introduce a combined MMOG processor, network, and memory load model that takes into account both the player interaction type
Consistency in Distributed Systems
"... Abstract. Data replication is a common technique for programming distributed systems, and is often important to achieve performance or reliability goals. Unfortunately, the replication of data can compromise its consistency, and thereby break programs that are unaware. In particular, in weakly cons ..."
Abstract
- Add to MetaCart
Abstract. Data replication is a common technique for programming distributed systems, and is often important to achieve performance or reliability goals. Unfortunately, the replication of data can compromise its consistency, and thereby break programs that are unaware. In particular, in weakly
Results 1 - 10
of
83