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.
Filters
Dominance-Based Service Selection Scheme with Concurrent Requests
2012
Journal of Computing Science and Engineering
Preserved Fulltext
Considering the dynamics of Web service environments and concurrency of requests, we propose in this paper a service selection scheme which adopts top-k dominating queries to generate a composition solution ...
rather than only select the best composition solution for a given request. ...
However, with the number of concurrent requests continuing to grow, the service selection scheme with SSize = 10 5 is much better than that with SSize = 10 3 or 10 4 . ...
doi:10.5626/jcse.2012.6.2.89
fatcat:ensueuczi5gtrkdco4a66vgf7m
FASS: A Fairness-Aware Approach for Concurrent Service Selection with Constraints
[article]
2019
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 2020; you can also visit the original URL.
The file type is application/pdf.
In this paper, we focus on the QoS-aware service selection with constraints from a fairness aspect, with the objective of achieving max-min fairness across multiple service requests sharing candidate service ...
A fairness-aware algorithm for concurrent service selection (FASS) is proposed, whose basic idea is to iteratively solve the single-objective subproblems by transforming them into linear programming problems ...
The iteration algorithm terminates, indicating the arise of concurrent service selection scheme with max-min fairness. ...
arXiv:1905.03857v1
fatcat:rbmv7qanuffs5p6el5u4ql2gai
Towards the Concurrent Optimization of the Server: A Case Study on Sport Health Simulation
2021
Complexity
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.
In this paper, we proposed a concurrent optimization scheme for the server that runs simulation experiments. ...
The experiment results show that the proposed concurrent optimization scheme can make better use of server resources and improve the simulation efficiency in the case of human sport simulation. ...
Figure 4 : 4 request to the selected server Updates cw of the selected server Select the application server with largest cw Updata cw of all application servers Flowchart of the dynamic load balancing ...
doi:10.1155/2021/5587170
fatcat:hnxj6ifum5b2namx3evwlkdwva
Multi-Hop Concurrent Transmission in Millimeter Wave WPANs with Directional Antenna
2010
2010 IEEE International Conference on Communications
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.
We then propose a multi-hop concurrent transmission (MHCT) scheme to exploit the spatial capacity of the mmWave WPAN. ...
In this paper, we first design a hop selection metric for the piconet controller (PNC) to select appropriate relay hops for a traffic flow, aiming to improve the flow throughput and balance the traffic ...
The Proposed Concurrent Transmission Scheme The proposed multi-hop concurrent transmission scheme is based on the hop selection metric designed above. ...
doi:10.1109/icc.2010.5502300
dblp:conf/icc/QiaoCS10
fatcat:hs2casv3bnhqzicvgpyvbeow7u
Programming support and adaptive checkpointing for high-throughput data services with log-based recovery
2010
2010 IEEE/IFIP International Conference on Dependable Systems & Networks (DSN)
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.
To keep in-memory objects persistent, SLACH employs application-assisted logging and checkpointing for log-based recovery while maximizing throughput and concurrency. ...
On the other hand, the availability requirement for these services is not as stringent as online services exposed to millions of users. ...
In this evaluation, we compare the performance of two schemes: 1) Base scheme, where logging is disabled; 2) Log scheme, which enables selective logging. ...
doi:10.1109/dsn.2010.5545015
dblp:conf/dsn/ZhouZTWY10
fatcat:od5k55rewvd43bclunlqr2c3ie
Design of QoS Aware Dominating set based Semantic Overlay Network (QADSON) for Content Distribution
2011
Journal of 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.
Aware Dominating set based Semantic Overlay Network (QADSON) in surrogate server selection to achieve the specified quality of service. ...
Approach: At first, we constructed the QoS aware dominating set based semantic overlay network which was a virtual network of surrogate servers that was built on top of existing physical network with the ...
This paper dealt with the implementation of Quality of Service aware dominating set for selecting the replication set of surrogate servers. ...
doi:10.3844/jcssp.2011.1478.1489
fatcat:ktqjgree6bfzpkjtplk2dspfl4
Selective early request termination for busy internet services
2006
Proceedings of the 15th international conference on World Wide Web - WWW '06
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 2010; you can also visit the original URL.
The file type is application/pdf.
This paper studies a load shedding mechanism called selective early request termination (SERT) for network services that use threads to handle multiple incoming requests continuously and concurrently. ...
By actively detecting and aborting overdue long requests, services can perform significantly better to achieve QoS objectives compared to a purely admission based approach. ...
BACKGROUND
Cluster-based Internet Services and Concurrency Control An Internet service cluster hosts applications handling concurrent client requests on a set of machines connected by a high speed network ...
doi:10.1145/1135777.1135866
dblp:conf/www/ZhouY06
fatcat:lssv3q7znvehbkj3yhinsuuedu
Optimal Video Placement Scheme for Batching VOD Services
2004
IEEE transactions on broadcasting
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 2013; you can also visit the original URL.
The file type is application/pdf.
In this paper, an optimal video placement scheme is proposed for a batching VOD system with multiple servers. ...
In order to evolve, parents are selected using a fitness proportionate selection scheme. ...
with batching scheme. ...
doi:10.1109/tbc.2003.822983
fatcat:t5vgv7gf3nfebjljqcbebwsfxq
State-Machine and Deferred-Update Replication: Analysis and Comparison
2017
IEEE Transactions on Parallel and Distributed Systems
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.
We also consider variants of systems that can process read-only requests with a lower overhead. In the analysis of DUR, we consider conflict patterns. ...
We estimate the lower bounds on the time of executing requests by the SMR and DUR systems running on multi-core servers. ...
On the contrary, any service can be easily replicated and deployed on a custom system using basic SMR scheme (with or without readers/writes locks) simply by intercepting and broadcasting requests sent ...
doi:10.1109/tpds.2016.2590422
fatcat:2vs2cojrijbmlc4ezdblvsmwou
An adaptive quality of service aware middleware for replicated services
2003
IEEE Transactions on Parallel and Distributed Systems
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.
The approach dynamically selects replicas to service a client's request based on the prediction made by probabilistic models. ...
Given the increasing demand for different services and the diversity of the requirements of clients, such adaptive frameworks that rely on feedback-based resource allocation are likely to play an increasing ...
For smaller think times, as the queuing effects become dominant, a more dynamic selection scheme, such as the model-based scheme we have proposed, performs better. ...
doi:10.1109/tpds.2003.1247672
fatcat:4djwvsjkifax3o7faov23lggfq
Practicing Oblivious Access on Cloud Storage
2015
Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security - CCS '15
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 2016; you can also visit the original URL.
The file type is application/pdf.
With a new understanding of the desirable properties, relevant metrics, and observations about the cloud services and their applications, we propose CURIOUS, a new modular partition-based ORAM framework ...
requests concurrently. ...
something written by a concurrent request. ...
doi:10.1145/2810103.2813649
dblp:conf/ccs/Bindschaedler0P15
fatcat:6wpbcn7kh5cwjc4inf4jducxly
A PAB-Based Multi-Prefetcher Mechanism
2006
International journal of parallel programming
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.
When compared with the non-selective concurrent use of multiple prefetchers, the PAB's application to prefetching from main memory to the L2 cache can reduce the number of loads from main memory by up ...
We introduce a "feedback" mechanism, termed Prefetcher Assessment Buffer (PAB), which filters out requests that are unlikely to be useful. ...
The solution is to coalesce such identical requests while they are waiting for service. ...
doi:10.1007/s10766-006-0006-1
fatcat:3c5wq5i2tfc75kfkkejevmea7m
Performance of a Mass-Storage System for Video-on-Demand
1995
Journal of Parallel and Distributed Computing
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.
From the experimental results, the storage system of Onyx machine can potentially provide about 360 concurrent video accesses with guaranteed quality of service. ...
Different video le stripping schemes, such as application level stripping and device driver level stripping, were examined in order to study scalability and performance issues. ...
Our study shows that a RAID 3 disk array can provide about 14 steady concurrent accesses with 512KB request size, which contains 16 video frames based on 32KB per video frame. ...
doi:10.1006/jpdc.1995.1134
fatcat:zryvfsklpba3viadnltkpirmpy
Hybrid Replication: State-Machine-Based and Deferred-Update Replication Schemes Combined
2013
2013 IEEE 33rd International Conference on Distributed Computing Systems
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 combines two schemes: a transaction is executed either optimistically by only one service replica in the deferred update mode (DU), or deterministically by all replicas in the state machine mode (SM ...
each transaction dynamically based on various parameters. ...
Requests are concurrently executed on all replicas. ...
doi:10.1109/icdcs.2013.30
dblp:conf/icdcs/KobusKW13
fatcat:t7pr3l6yuvgorf35mhhunzzp3e
A Solution for Instant Response of Cloud Platform Based on Nginx + Keepalived
2019
DEStech Transactions on Computer Science and 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 2020; you can also visit the original URL.
The file type is application/pdf.
Test results show that, with respect to analysis on 50% or 80% of the requests, the average response time for 10,000 concurrent requests is only 101 ms and 152 ms, with memory usage up to 22% and CPU peak ...
This document presents an instant response solution for cloud platform based on Nginx + Keepalived, which, by means of Nginx, enables selection of proper load balancing algorithm based on the scenario ...
Based on the test results given above, with respect to analysis on 50% or 80% of the requests, the average response time for 10,000 concurrent requests is only 101 ms and 152 ms; the maximum memory usage ...
doi:10.12783/dtcse/cscme2019/32516
fatcat:jhrex6gotfe7figvr3xoutk6iu
« Previous
Showing results 1 — 15 out of 36,898 results