A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
Filters
A dynamic hybrid scheduling algorithm for heterogeneous asymmetric environments
2005
International Journal of Parallel, Emergent and Distributed Systems
Preserved Fulltext
In order to achieve a better performance, the framework is enhanced to allow a set of consecutive push and pull operations, depending on the probabilities of the data items present in the system. ...
The objective of this dissertation is to investigate and develop a novel hybrid scheduling platform by effectively combining broadcasting (push) of popular data and dissemination (pull) of less popular ...
Chapter 4 Adaptive Push-Pull Algorithm with Performance Guarantee A dynamic hybrid scheduling [37] is proposed, which does not combine the push and pull in a static, sequential order. ...
doi:10.1080/17445760500094913
fatcat:dlatfsdkbngkxne2py22vr74dy
Push Less and Pull the Current Highest Demanded Data Item to Decrease the Waiting Time in Asymmetric Communication Environments
[chapter]
2002
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
We introduce a hybrid scheduling that effectively combines broadcasting for very popular data (push data) and dissemination upon-request for less popular data (pull data) in asymmetric communication environments ...
in a pure push system and also on that spent in some of the hybrid systems already proposed in literature. ...
To overcome such a drawback, we propose a new hybrid scheduling which continuously broadcasts one push item and disseminates one pull item. ...
doi:10.1007/3-540-36385-8_21
fatcat:jpsauqyjynfahidhm65dh4cczm
Piggybacking on social networks
2013
Proceedings of the VLDB Endowment
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We also evaluate our algorithms on a real social networking system prototype and we show that the actual increase in throughput corresponds nicely to the gain anticipated by our cost function. ...
We propose an O(log n) approximation algorithm and a heuristic to solve the problem, and evaluate them using the full Twitter and Flickr social graphs, which have up to billions of edges. ...
With a push-all schedule, the system pushes new events by Art to Billie's view-the dashed thick red arrow in Figure 2 (b). ...
doi:10.14778/2536336.2536342
fatcat:2bogp3fjmfbdlfhokuom65gjaq
SNAP: SNowbAll multi-tree Pushing for Peer-to-Peer Media Streaming
[article]
2010
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
In this paper, we embrace the hybrid push-pull structure for peer-to-peer media streaming. ...
Finally, we perform simulations in ns-2; the results indicate that our approach outperforms a recently proposed hybrid streaming system. ...
This will greatly facilitate the distributed minimum-delay chunk scheduling in a push-pull hybrid streaming system. ...
arXiv:1009.2282v1
fatcat:3yuoxbi7evfm7e3ty73ettbbta
Pattern-Push: A low-delay mesh-push scheduling for live peer-to-peer streaming
2009
2009 IEEE International Conference on Multimedia and Expo
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Simulation results show that pattern-push achieves a significantly lower delay and overhead as compared with both traditional and recent scheduling algorithms proposed in the literature. ...
It is challenging to develop a scheduling algorithm that achieves low delay given heterogeneous bandwidth, propagation delays and available content in all the parents. ...
Content scheduling may be roughly divided into four categories: tree-push, mesh-pull, hybrid pull-push, and mesh-push. ...
doi:10.1109/icme.2009.5202705
dblp:conf/icmcs/ZhengCLB09
fatcat:2jcsecobcjboni74td7ty7aa2q
HUGE: An Efficient and Scalable Subgraph Enumeration System
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2021 pre-print arXiv:2103.14294v1 fatcat:lyuszlx7nnefxphnja3rqsg6wa
HUGE features 1) an optimiser to compute an advanced execution plan without the constraints of existing works; 2) a hybrid communication layer that supports both pushing and pulling communication; 3) a ...
HUGE is generic such that all existing distributed subgraph enumeration algorithms can be plugged in to enjoy automatic speed up and bounded-memory execution. ...
Such static heuristics lack in theoretical guarantee and can perform poorly in practice. ...
arXiv:2103.14294v2
fatcat:nxroce7pgzgdvhjwnlurmv6uou
Practical algorithm for minimum delay peer-to-peer media streaming
2010
2010 IEEE International Conference on Multimedia and Expo
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
a systematic way to construct the chunk scheduling that achieves the minimum delay bound. ...
We design algorithms to construct and maintain our SNowbAll multi-tree Pushing (SNAP) overlay. Our simulations in ns-2 indicate that our approach outperforms other tree-based mechanisms. ...
Having such a complete neighbor table at every peer, SNAP can proceed in a distributed way: each peer, upon receiving a new chunk, chooses a subset of peers in a round-robin fashion and pushes the chunk ...
doi:10.1109/icme.2010.5582931
dblp:conf/icmcs/Luo10
fatcat:2qz4umriprbdhc4zday66y376u
An Efficient Hybrid Push-Pull Based Protocol for VOD In Peerto-Peer network
2014
IOSR Journal of Computer Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
A new proposed data exchange schema is called Efficient Hybrid Push-Pull based Protocol (EHP3) can reduce the initial playback delay and improve the quality of service. ...
If there are no missing segments in the priority region, the downstream peer uses the pull protocol to download the missing segments which are outside the priority region. ...
This research addresses these issues through the implementation and evaluation of a new data exchange scheme called Efficient Hybrid Push-Pull based Protocol (EHP3). ...
doi:10.9790/0661-16336773
fatcat:omgy3sqa4nhntndfys27f7myvy
Hybrid Pulling/Pushing for I/O-Efficient Distributed and Iterative Graph Computing
2016
Proceedings of the 2016 International Conference on Management of Data - SIGMOD '16
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Second, we design a seamless switching mechanism and a prominent performance prediction method to guarantee efficiency when switching between push and b-pull. ...
This paper proposes a hybrid solution to support switching between push and pull adaptively, to obtain optimal performance for distributed systems with disk-resident data in different scenarios. ...
Note that M is not available if hybrid is switching from push to b-pull, because no new message is produced (as shown in Fig. 6) . ...
doi:10.1145/2882903.2882938
dblp:conf/sigmod/Wang0BYY16
fatcat:k5yvwlzlkbh3hexcvzefwtkjmu
Angel: a new large-scale machine learning system
2017
National Science Review
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
In this paper, we propose a new system, named Angel, to facilitate the development of large-scale ML applications in production environment. ...
By allowing concurrent updates to model across different groups and scheduling the updates in each group, Angel can achieve a good balance between hardware efficiency and statistical efficiency. ...
Angel employed hybrid parallelism to accelerate the performance of ML algorithms. The pulling of parameters and the pushing of updates were fully optimized in Angel to reduce the network overheads. ...
doi:10.1093/nsr/nwx018
fatcat:qtp4yspgizbxbo36p2milrhxoe
$\mathcal{P}ro\mathcal{M}o$ – A Scalable and Efficient Framework for Online Data Delivery
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
It is flexible since it can accommodate push, pull or hybrid push-pull solutions. It is efficient since it exploits server capabilities in meeting client demands. ...
These algorithms are used by the Server Monitor module in ProMo to generate a pull schedule which minimizes the monitoring tasks while satisfying client needs. ...
doi:10.1007/11780991_38
fatcat:chtk3suovzfajmzgbezlhlkj6e
Profile-Based Online Data Delivery
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
Our proposed solution utilizes a uniform client and server profilization for data delivery and describe the challenges in developing optimized hybrid data delivery schedules. ...
This research is aimed at providing theoretically rigorous, flexible, efficient, and scalable methodologies for intelligent delivery of data in a dynamic and resource constrained environment. ...
Several hybrid push-pull solutions have also been presented in the past (e.g, [5] ). ...
doi:10.1007/11915072_47
fatcat:uvb6nlsdgbd37knzbejyjcxbau
Flexible Multi-Threaded Scheduling for Continuous Queries over Data Streams
2007
2007 IEEE 23rd International Conference on Data Engineering Workshop
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
To overcome these drawbacks, we propose in this work a hybrid approach that flexibly assigns threads to subgraphs of the query graph. ...
Within a DSMS, the scheduling of the queries and their operators has proved to be of utmost importance. ...
These two facts lead us to choose the push-based approach.
Scheduling Let us now present our novel hybrid multi-threaded scheduling approach called hybrid multi-threaded scheduling (HMTS). ...
doi:10.1109/icdew.2007.4401049
dblp:conf/icde/CammertHKSVW07
fatcat:hnwboux2ffg5fgfp2pbpd5p7g4
A Unified Framework for Sub-stream Scheduling in P2P Hybrid Streaming Systems and How to Do Better?
[chapter]
2009
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In a hybrid system, the sub-stream pushing module sets up a local tree structure between peers based on the topology formed by the chunk-pulling module. ...
The pull-push hybrid P2P streaming, as an emerging and promising approach, has achieved some success in delivering live video traffic. ...
Recently, researchers are exploring a new class of pull-push hybrid architectures. ...
doi:10.1007/978-3-642-01399-7_57
fatcat:okavitmsnndcxksmnw5y6zi2x4
A framework for scalable dissemination-based systems
1997
SIGPLAN notices
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The dramatic improvements in global interconnectivity due "' . to intranets, extranets, and the Internet has led to an explosion in the number and variety of new data-intensive applications. ...
Recently, push-based techniques have been proposed as a solution to, ,scalability problems for distributed applications. ...
Swarup Acharya for his contributions to these ideas through the development of the Broadcast Disks paradigm and Demet Aksoy who has provided us with important insights into the properties of broadcast scheduling ...
doi:10.1145/263700.263725
fatcat:pqn7fzogcvcyberaeeywzcmkp4
« Previous
Showing results 1 — 15 out of 4,413 results