Matches in ScholarlyData for { ?s ?p ?o. }
- item-4 hasContent shriram-krishnamurthi.
- item-4 previous item-3.
- 145 creator chunqiang-tang.
- 145 creator giovanni-pacifici.
- 145 creator malgorzata-steinder.
- 145 creator michael-spreitzer.
- 145 type InProceedings.
- 145 label "A Scalable Application Placement Controller for Enterprise Data Centers".
- 145 sameAs 145.
- 145 abstract "Given a set of machines and a set ofWeb applications with dynamically changing demands, an application placement controller decides how many instances to run for each application and where to put them, while observing all kinds of resource constraints. This problem is NP hard. In this paper, we propose an online algorithm that uses heuristics to efficiently solve this problem. It allows multiple applications to share a single machine, and strives to maximize the total satisfied application demand, to minimize the number of application starts and stops, and to balance the load across machines. It can produce within 30 seconds high-quality solutions for hard placement problems with thousands of machines and thousands of applications. This scalability is crucial for dynamic resource provisioning in large-scale enterprise data centers. Our algorithm significantly and consistently outperforms the existing state-of-the-art algorithm under a wide variety of workloads.".
- 145 hasAuthorList authorList.
- 145 isPartOf proceedings.
- 145 title "A Scalable Application Placement Controller for Enterprise Data Centers".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasItem item-4.
- authorList hasLastItem item-4.
- item-1 type ListItem.
- item-1 hasContent chunqiang-tang.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent malgorzata-steinder.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent michael-spreitzer.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent giovanni-pacifici.
- item-4 previous item-3.
- 15 creator filippo-geraci.
- 15 creator marco-pellegrini.
- 15 creator yon-dourisboure.
- 15 type InProceedings.
- 15 label "Extraction and classification of dense communities in the Web".
- 15 sameAs 15.
- 15 abstract "The World Wide Web (WWW) is rapidly becoming important for society as a medium for sharing data, information and services, and there is a growing interest in tools for understanding collective behaviors and emerging phenomena in the WWW. In this paper we focus on the problem of searching and classifying {\em communities} in the web. Loosely speaking a community is a group of pages related to a common interest. More formally communities have been associated in the computer science literature with the existence of a locally dense sub-graph of the web-graph (where web pages are nodes and hyper-links are arcs of the web-graph). The core of our contribution is a new scalable algorithm for finding relatively dense subgraphs in massive graphs. We apply our algorithm on web-graphs built on three publicly available large crawls of the web (with raw sizes up to 120M nodes and 1G arcs). The effectiveness of our algorithm in finding dense subgraphs is demonstrated experimentally by embedding artificial communities in the web-graph and counting how many of these are blindly found. Effectiveness increases with the size and density of the communities: it is close to 100\% for communities of a thirty nodes or more (even at low density). It is still about 80\% even for communities of twenty nodes with density over $50\%$ of the arcs present. At the lower extremes the algorithm catches 35\% of dense communities made of ten nodes. We complete our Community Watch system by clustering the communities found in the web-graph into homogeneous groups by topic and labelling each group by representative keywords.".
- 15 hasAuthorList authorList.
- 15 isPartOf proceedings.
- 15 title "Extraction and classification of dense communities in the Web".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasLastItem item-3.
- item-1 type ListItem.
- item-1 hasContent yon-dourisboure.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent filippo-geraci.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent marco-pellegrini.
- item-3 previous item-2.
- 158 creator christos-gkantsidis.
- 158 creator dinan-gunawardena.
- 158 creator pablo-rodriguez.
- 158 creator saikat-guha.
- 158 creator siddhartha-annapureddy.
- 158 type InProceedings.
- 158 label "Is High-Quality VoD Feasible using P2P Swarming?".
- 158 sameAs 158.
- 158 abstract "Digital media companies have recently started embracing P2P networks as an alternative content distribution channel. However, the drawback of the current {\em P2P swarming} systems is that users need to download the full video and, hence, wait a long time before they can start watching it. While a lot of effort has gone into optimizing the distribution of large files, little research has been done on how to enable high-quality Video-on-Demand (VoD) functionality with P2P swarming systems. The main challenges reside in ensuring that users can start watching a movie at any point in time, while providing small start-up times, sustainable playback rates and high swarming efficiencies.<br /><br /> In this work, we explore the feasibility of providing high-quality VoD using P2P mesh-based networks. To this extent, we investigate scheduling and pre-fetching techniques, network coding, and mesh topology management. Using both simulations and results from a real implementation, we provide evidence that high-quality VoD is feasible, and give guidelines to enable play-as-you-download P2P swarming systems with high playback rates and minimum start-up delays.".
- 158 hasAuthorList authorList.
- 158 isPartOf proceedings.
- 158 title "Is High-Quality VoD Feasible using P2P Swarming?".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasItem item-4.
- authorList hasItem item-5.
- authorList hasLastItem item-5.
- item-1 type ListItem.
- item-1 hasContent siddhartha-annapureddy.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent saikat-guha.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent dinan-gunawardena.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent christos-gkantsidis.
- item-4 next item-5.
- item-4 previous item-3.
- item-5 type ListItem.
- item-5 hasContent pablo-rodriguez.
- item-5 previous item-4.
- 161 creator david-huynh.
- 161 creator david-karger.