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.
Filters
Prism: Scaling Bitcoin by 10,000x
[article]
2020
arXiv
pre-print
Preserved Fulltext
Other Versions
We present an implementation of Prism which achieves a throughput of 70,000 transactions per second and confirmation latencies of tens of seconds. ...
Prism is a new blockchain protocol which is designed to achieve a natural scaling of Bitcoin's performance while maintaining its full security guarantees. ...
The Ledger Manager is a two-stage pipeline and runs asynchronously with respect to the Block Structure Manager. ...
arXiv:1909.11261v2
fatcat:jd3j7ccvzveotkvcwtbiw77opa
PRISM: Privacy-friendly routing in suspicious MANETs (and VANETs)
2008
Network Protocols (ICNP), Proceedings of the IEEE International Conference on
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 2015; you can also visit the original URL.
The file type is application/pdf.
We analyze security, privacy and performance of PRISM and compare it to alternative techniques. Results show that PRISM is more computationally efficient and offers better privacy than prior work. * ...
To this end, we construct an on-demand location-based anonymous MANET routing protocol (PRISM) that achieves privacy and security against both outsider and insider adversaries. ...
Sometimes, the task of adding new members is given to a separate entity called a Membership Manager. Similarly, revocation duties are sometimes delegated to a separate Revocation Manager. ...
doi:10.1109/icnp.2008.4697044
dblp:conf/icnp/DefrawyT08
fatcat:tw3frej4grekvo24vgpd4eeezi
Formal reliability analysis of a typical FHIR standard based e-Health system using PRISM
2014
2014 IEEE 16th International Conference on e-Health Networking, Applications and Services (Healthcom)
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.
As a first step towards this direction, we propose to use probabilistic model checking, i.e., a formal probabilistic analysis approach, to assess the reliability of a typical e-health system used in hospitals ...
In particular, we use the PRISM model checker to analyze the Markov Decision Process (MDP) and Continuous Time Markov Chain (CTMC) models to assess the failure probabilities of the overall system. ...
This model can then be used to verify probabilistic properties. Many probabilistic model checkers, including PRISM [15] , YMER [19] , MRMC [20] , VESTA [21] and ETMCC [22] are available. ...
doi:10.1109/healthcom.2014.7001811
dblp:conf/healthcom/PervezHLTGH14
fatcat:iglkvm65jndbxmfuaj2xa6hobu
PRISM: A Hierarchical Intrusion Detection Architecture for Large-Scale Cyber Networks
[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.
Furthermore, PRISM introduces a stream management procedure that rectifies the issue of alert reordering when collected from distributed alert reporting systems. ...
PRISM has a unique multi-layered architecture that monitors network traffic distributedly to provide efficiency in processing and modularity in design. ...
required computing resources. 3) Alert stream management: PRISM manages the alert streams from multiple surveillance zones by implementing an efficient alert stream management mechanism. ...
arXiv:2111.11000v1
fatcat:ismyvrmvaraa7eb3thflbr2it4
Spatial Locality-Aware Cache Partitioning for Effective Cache Sharing
2015
2015 44th International Conference on Parallel Processing
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.
Keywords -shared last level cache; cache partitioning; spatial locality; cache management; high bandwidth memory. ...
In modern multi-core processors, last-level caches (LLCs) are typically shared among multiple cores. ...
Saurabh Gupta is currently supported by the Oak Ridge Leadership Computing Facility at the Oak Ridge National Laboratory, which is managed by UT Battelle, LLC for the U.S. DOE (under the contract No. ...
doi:10.1109/icpp.2015.24
dblp:conf/icpp/GuptaZ15
fatcat:yfywugggwjfuzm5lfvghodwvda
Futility Scaling: High-Associativity Cache Partitioning
2014
2014 47th Annual IEEE/ACM International Symposium on Microarchitecture
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.
As shared last level caches are widely used in many-core CMPs to boost system performance, partitioning a large shared cache among multiple concurrently running applications becomes increasingly important ...
Simulation results show that FS improves performance over previously proposed Vantage and PriSM by up to 6.0% and 13.7%, respectively. ...
Similarly, Probabilistic Sharedcache Management (PriSM [10] ) controls the partitioning by adjusting the eviction probability of each partition based on its insertion rate and size deviation from its ...
doi:10.1109/micro.2014.46
dblp:conf/micro/WangC14
fatcat:g5lcz3lc7fbm3gcfle2ujv2yw4
A Comparative Study of BDD Packages for Probabilistic Symbolic Model Checking
[chapter]
2015
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 2019; you can also visit the original URL.
The file type is application/pdf.
We provide experimental results for several well-known probabilistic benchmarks and study the effect of several optimisations. ...
While various BDD and MTBDD packages have been developed in the community, the CUDD package remains the default choice of most of the symbolic (probabilistic) model checkers. ...
As case studies, we use various well-known probabilistic examples from the PRISM website [31] . ...
doi:10.1007/978-3-319-25942-0_3
fatcat:jtfcnc2qwfdzbebwvfol5mkjbe
A Probabilistic Quantitative Analysis of Probabilistic-Write/Copy-Select
[chapter]
2013
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.
Probabilistic-Write/Copy-Select (PWCS) is a novel synchronization scheme suggested by Nicholas Mc Guire which avoids expensive atomic operations for synchronizing access to shared objects. ...
Mc Guire describes PWCS for multiple readers but only one writer of a shared data structure. ...
In the approach of Mc Guire, writers are viewed as fault injectors that access the shared data items probabilistically. ...
doi:10.1007/978-3-642-38088-4_21
fatcat:45xx32sxc5brfmrvnuyfge5kuy
Dynamic and discrete cache insertion policies for managing shared last level caches in large multicores
2017
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 2018; you can also visit the original URL.
The file type is application/pdf.
It uses the same methodology [3] to manage applications in shared cache environment. ...
We further find that probabilistically de-prioritizing certain applications during cache insertions (that is, not inserting the cache lines) provides a scalable solution for efficient cache management. ...
doi:10.1016/j.jpdc.2017.02.004
fatcat:24hmq6ycqnhhxcmyt2hzaxrmpu
Waiting for Locks: How Long Does It Usually Take?
[chapter]
2012
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 2016; you can also visit the original URL.
The file type is application/pdf.
This paper reports on our experiences made in a running project where the goal is to apply probabilistic model checking techniques and to align the results of the model checker with measurements to predict ...
Quantitative Analysis Using PRISM. For the quantitative analysis of the DTMC of the TTS spinlock we used the probabilistic model checker PRISM [13] . ...
For the synchronisation, we followed the approach of PRISM's input language with synchronisation over shared actions. ...
doi:10.1007/978-3-642-32469-7_4
fatcat:p3hvjwq4bzdzxku2ivcpjavyri
Improving GPU Sparse Matrix-Vector Multiplication for Probabilistic Model Checking
[chapter]
2012
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.
We implemented the matrix reindexing and the efficient memory access methods in GPU-PRISM, an extension of the probabilistic model checker PRISM. ...
The methods enhance sparse matrix-vector multiplications, which are in the core of the probabilistic model checking algorithms. ...
All methods were implemented in GPU-PRISM, an extension of the probabilistic model checker PRISM. ...
doi:10.1007/978-3-642-31759-0_9
fatcat:iydlwalz3jhz7ikeuzsimq4sze
Discrete Cache Insertion Policies for Shared Last Level Cache Management on Large Multicores
2016
2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS)
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.
Consequently, with large multicore processors, the number of cores that share the LLC becomes larger than the associativity of the cache itself. ...
Multi-core processors employ shared Last Level Caches (LLC). This trend will continue in the future with large multi-core processors (16 cores and beyond) as well. ...
Hence, we are presented with the scenario of managing shared caches where (#cores ≥ #llc ways). ...
doi:10.1109/ipdps.2016.30
dblp:conf/ipps/SridharanS16
fatcat:bq2i7o7kn5be7jkhda424erpwe
Platform-as-a-Service Architecture for Real-Time Quality of Service Management in Clouds
2010
2010 Fifth International Conference on Internet and Web Applications and Services
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.
PRISM models) that factor in probabilistic human interactive behaviours. ...
PRISM accepts specifications in probabilistic temporal logic that allows us to express probabilistic properties answering questions such as: "The probability to finish task X in Y time", "the probability ...
doi:10.1109/iciw.2010.91
fatcat:dtfva5gw3jg7rnfnbz45bq3bc4
Take up DNSSEC When Needed
[article]
2016
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.
The threats of caching poisoning attacks largely stimulate the deployment of DNSSEC. ...
This paper proposes a new defense against cache poisoning attacks, still using but lightly using DNSSEC. ...
PRISM [10] is an open-source probabilistic model checker, providing support for building and analyzing several types of probabilistic models. ...
arXiv:1602.08459v1
fatcat:26pseddjpje5vo7acjfnq3gzg4
Probabilistic Directed Writebacks for Exclusive Caches
2016
SIGARCH Computer Architecture News
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 adapt Flajolet and Martin's probabilistic counting to keep the state small: two additional bits per L1D block, with an additional 6KB prediction table. ...
Although caches can save energy in several ways, such as by decreasing execution time and reducing the number of main memory accesses, they also suffer from known inefficiencies: the last-level cache ( ...
L3 (LLC) Shared. 32-way 4MB. LRU. ...
doi:10.1145/2971331.2971334
fatcat:tpsk5t5kqjdtzidheugn7goxfy
« Previous
Showing results 1 — 15 out of 309 results