Filters








16,656 Hits in 2.4 sec

PA-RISC to IA-64: transparent execution, no recompilation

C. Zheng, C. Thompson
2000 Computer  
T ransitioning to a new architecture is never easy. Users want to keep running their favorite applications as they normally would, without stopping to adapt them to a different platform.  ...  For common applications that spend most of their time in a small part of code, emulation costs go down significantly because Aries translates only the most frequently executed code into native IA-64 instructions  ...  Also, it cannot yet emulate applications that link in both PA-RISC and IA-64 shared libraries.  ... 
doi:10.1109/2.825695 fatcat:wmeyjjdpsnbs7plq6xdp72uk4y

CompSC

Zhenhao Pan, Yaozu Dong, Yu Chen, Lei Zhang, Zhijiao Zhang
2012 SIGPLAN notices  
In this paper, we propose CompSC: a solution of hardware state migration that will enable the live migration support of passthrough devices.  ...  Our experiments show that CompSC enables live migration on an Intel 82599 VF with a throughput 282.66% higher than para-virtualized devices.  ...  We also would like to thank Ian Pratt for his insight in the paper. This work has been supported by National Natural Science Foundation of China under Grant No. 61170050 and Grant No. 60973143.  ... 
doi:10.1145/2365864.2151040 fatcat:rnesnsaagzg73pp3mr3ekcgpay

CompSC

Zhenhao Pan, Yaozu Dong, Yu Chen, Lei Zhang, Zhijiao Zhang
2012 Proceedings of the 8th ACM SIGPLAN/SIGOPS conference on Virtual Execution Environments - VEE '12  
In this paper, we propose CompSC: a solution of hardware state migration that will enable the live migration support of passthrough devices.  ...  Our experiments show that CompSC enables live migration on an Intel 82599 VF with a throughput 282.66% higher than para-virtualized devices.  ...  We also would like to thank Ian Pratt for his insight in the paper. This work has been supported by National Natural Science Foundation of China under Grant No. 61170050 and Grant No. 60973143.  ... 
doi:10.1145/2151024.2151040 dblp:conf/vee/PanDCZZ12 fatcat:ajaokgb2frh43nrlmmpo6q4xki

The collective memory of amnesic processes

Rachid Guerraoui, Ron R. Levy, Bastian Pochon, Jim Pugh
2008 ACM Transactions on Algorithms  
This paper considers the problem of robustly emulating a shared atomic memory over a distributed message passing system where processes can fail by crashing and possibly recover.  ...  We revisit the notion of atomicity in the crash-recovery context and introduce a generic algorithm that emulates an atomic memory.  ...  In an asynchronous message passing system where processes can fail by crashing and are supposed to never recover (crash-stop model), robust (fault-tolerant) atomic memory emulations [2, 3, 13, 14] have  ... 
doi:10.1145/1328911.1328923 fatcat:mcewbmotcveyngscozbidhmquy

Practical taint-based protection using demand emulation

Alex Ho, Michael Fetterman, Christopher Clark, Andrew Warfield, Steven Hand
2006 Proceedings of the 2006 EuroSys conference on - EuroSys '06  
ability to dynamically switch a running system between virtualized and emulated execution.  ...  Unlike past approaches to taint tracking, which track tainted data by running the system completely in an emulator or simulator, resulting in considerable execution overhead, our work demonstrates the  ...  The authors would also like to thank our shepherd Gilles Muller, and Fabrice Bellard for his excellent work in creating a versatile open-source emulator that proved both enjoyable and educational to extend  ... 
doi:10.1145/1217935.1217939 dblp:conf/eurosys/HoFCWH06 fatcat:5qzr6jzyirh3vd6h44skc6ju74

Practical taint-based protection using demand emulation

Alex Ho, Michael Fetterman, Christopher Clark, Andrew Warfield, Steven Hand
2006 ACM SIGOPS Operating Systems Review  
ability to dynamically switch a running system between virtualized and emulated execution.  ...  Unlike past approaches to taint tracking, which track tainted data by running the system completely in an emulator or simulator, resulting in considerable execution overhead, our work demonstrates the  ...  The authors would also like to thank our shepherd Gilles Muller, and Fabrice Bellard for his excellent work in creating a versatile open-source emulator that proved both enjoyable and educational to extend  ... 
doi:10.1145/1218063.1217939 fatcat:hiwss3754bcorm7xdowv6hfoqu

ANANAS - A Framework for Analyzing Android Applications

Thomas Eder, Michael Rodler, Dieter Vymazal, Markus Zeilinger
2013 2013 International Conference on Availability, Reliability and Security  
Android is an open software platform for mobile devices with a large market share in the smartphone sector.  ...  The openness of the system as well as its wide adoption lead to an increasing amount of malware developed for this platform.  ...  ACKNOWLEDGEMENTS We would like to thank Christian Nösterer and Thomas Traunmüller for contributing to ANANAS during their time in Hagenberg.  ... 
doi:10.1109/ares.2013.93 dblp:conf/IEEEares/EderRVZ13 fatcat:siztod4zvvenfpfsjlbzjpqkie

Sharing memory robustly in message-passing systems

Hagit Attiya, Amotz Bar-Noy, Danny Dolev
1995 Journal of the ACM  
A shared register guarantees that once a processor reade a particular value, then, unless the value of this register is changed by a write, every future read of this register by any other processor will  ...  In the shared-memory model, processors may fail by stopping (and a slow process cannot be distinguished from a failed processor).  ... 
doi:10.1145/200836.200869 fatcat:fed72xtuvzhnbkms4wl7w6kvzu

Sharing memory robustly in message-passing systems

Hagit Attiya, Amotz Bar-Noy, Danny Dolev
1990 Proceedings of the ninth annual ACM symposium on Principles of distributed computing - PODC '90  
A shared register guarantees that once a processor reade a particular value, then, unless the value of this register is changed by a write, every future read of this register by any other processor will  ...  In the shared-memory model, processors may fail by stopping (and a slow process cannot be distinguished from a failed processor).  ... 
doi:10.1145/93385.93441 dblp:conf/podc/AttiyaBD90 fatcat:5z5qvthkzjfqnezrwj2y4urs5u

Fork-consistent constructions from registers

Matthias Majuntke, Dan Dobre, Neeraj Suri
2011 Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing - PODC '11  
a weakly fork-linearizable emulation of a shared memory that ensures waitfreedom when the registers are correct.  ...  A read-modify-write object is much more powerful than a shared memory made of so-called registers, which lie in the weakest class of all shared objects in this hierarchy.  ...  System Model We consider a distributed system consisting of n > 1 clients C 1 , . . . , C n that communicate through shared objects.  ... 
doi:10.1145/1993806.1993837 dblp:conf/podc/MajuntkeDS11 fatcat:qcmsqak6ofhv3lejifypnvsdo4

Fork-Consistent Constructions from Registers [chapter]

Matthias Majuntke, Dan Dobre, Christian Cachin, Neeraj Suri
2011 Lecture Notes in Computer Science  
a weakly fork-linearizable emulation of a shared memory that ensures waitfreedom when the registers are correct.  ...  A read-modify-write object is much more powerful than a shared memory made of so-called registers, which lie in the weakest class of all shared objects in this hierarchy.  ...  System Model We consider a distributed system consisting of n > 1 clients C 1 , . . . , C n that communicate through shared objects.  ... 
doi:10.1007/978-3-642-25873-2_20 fatcat:zguzas3ctbbi7cjdctxpf6i7qq

Efficient System-Enforced Deterministic Parallelism [article]

Amittai Aviram, Shu-Chun Weng, Sen Hu, Bryan Ford
2010 arXiv   pre-print
The system runs parallel applications deterministically both on multicore PCs and across nodes in a cluster.  ...  Determinator is a novel operating system that enforces determinism on both multithreaded and multi-process computations.  ...  Get Copy register state, a virtual memory range, and/or changes since the last snapshot out of a child space. Ret Stop and wait for parent to issue a Get or Put.  ... 
arXiv:1005.3450v1 fatcat:2zzzgu5q3vcltklzvmlc6b4ccq

Efficient system-enforced deterministic parallelism

Amittai Aviram, Shu-Chun Weng, Sen Hu, Bryan Ford
2012 Communications of the ACM  
Coarse-grained parallel benchmarks perform and scale comparably to nondeterministic systems, on both multicore PCs and across nodes in a distributed cluster.  ...  We introduce a new parallel programming model addressing these issues, and use Determinator, a proof-of-concept OS, to demonstrate the model's practicality.  ...  Get Child space Copy register state, virtual memory range, and/or changes since the last snapshot out of a child. Ret Parent space Stop and wait for parent to issue a Get or Put.  ... 
doi:10.1145/2160718.2160742 fatcat:7ptdywth7jffvawn7vsatlmts4

Sharing is harder than agreeing

Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui
2008 Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing - PODC '08  
One of the most celebrated results of the theory of distributed computing is the impossibility, in an asynchronous system of n processes that communicate through shared memory registers, to solve the set  ...  This paper explores the relation between these abstractions in a message passing system where a register is not a given physical device but is rather itself implemented by processes communicating through  ...  In fact, what is actually shown in [16] is that any number of registers shared by two processes can be used to implement a register shared by any number of processes.  ... 
doi:10.1145/1400751.1400764 dblp:conf/podc/Delporte-GalletFG08 fatcat:mnvctunoznehnlrazumyofxkmq

Minemu: The World's Fastest Taint Tracker [chapter]

Erik Bosman, Asia Slowinska, Herbert Bos
2011 Lecture Notes in Computer Science  
We believe that the new design may be suitable for certain classes of applications in production systems.  ...  In other words, we designed a new type of emulator from scratch with the goal of removing superfluous instructions to propagate taint. The results are very promising.  ...  As a result, there is no need to change (and thus to save and restore) the contents of general purpose registers.  ... 
doi:10.1007/978-3-642-23644-0_1 fatcat:wysnyqd3v5hm3jn66tgjcdhfma
« Previous Showing results 1 — 15 out of 16,656 results