A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
Filters
Knowledge in shared memory systems (preliminary version)
1991
Proceedings of the tenth annual ACM symposium on Principles of distributed computing - PODC '91
Preserved Fulltext
In addition we generalize a known impossibility result, and show that results about how knowledge can be gained and lost in message passing systems also hold for shared memory systems. ...
We study the relation between knowledge and space. That is, we analyze how much shared memory space is needed in order to learn certain kinds of facts. ...
of the
notion
of knowledge
for reasoning
about
shared
memory
systems. ...
doi:10.1145/112600.112617
dblp:conf/podc/MerrittT91
fatcat:tf75hppxnbghlgul4bsdffadni
Knowledge states for the caching problem in shared memory multiprocessor systems
2004
7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.
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 2012; you can also visit the original URL.
The file type is application/pdf.
Multiprocessor systems with a global shared memory provide logically uniform data access. To hide latencies when accessing global memory each processor makes use of a private cache. ...
Several copies of a data item may exist concurrently in the system. To guarantee consistency when updating an item a processor must invalidate copies of the item in other private caches. ...
[7] have answered this question in the affirmative. ...
doi:10.1109/ispan.2004.1300497
dblp:conf/ispan/BeinLR04
fatcat:5cpllbxqvre5pmwdsoz25a4spe
KNOWLEDGE STATES FOR THE CACHING PROBLEM IN SHARED MEMORY MULTIPROCESSOR SYSTEMS
2009
International Journal of Foundations 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 2012; you can also visit the original URL.
The file type is application/pdf.
Multiprocessor systems with a global shared memory provide logically uniform data access. To hide latencies when accessing global memory each processor makes use of a private cache. ...
Several copies of a data item may exist concurrently in the system. To guarantee consistency when updating an item a processor must invalidate copies of the item in other private caches. ...
[7] have answered this question in the affirmative. ...
doi:10.1142/s0129054109006504
fatcat:xehre2bblbde3bdqpfiu4p4t54
Understanding and using asynchronous message passing (Preliminary Version)
1982
Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing - PODC '82
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.
David Cries, Leslie Lamport and Gary Levin have been invaluable in formulating the ideas in this paper. ...
In sLm~nary, the absence of shared memory complicates the programming task without a corresponding simplification in the proof. ...
Primitives intended for communication and synchronization with shared memory allow processes to interrogate each others' states to effect synchronization. ...
doi:10.1145/800220.806691
dblp:conf/podc/SchlichtingS82
fatcat:4dy3lrc3o5cbdn7lkk36o5xhha
Cheating husbands and other stories (preliminary version)
1985
Proceedings of the fourth annual ACM symposium on Principles of distributed computing - PODC '85
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.
By looking at a number of variants of the clteatir~g Itusbcads puzzle, we illustrate the subtle relationship between knowledge, communication, and action in a distributed environment. ...
The interesting case of Theorem 10{c) was suggested by the audience at a talk delivered in Tel Aviv University. ...
Acknowledgements: We thank Martin Gardner, Bengt Jonsson, Don Knuth, and Moshe Vardi for insightful comments on earlier versions. ...
doi:10.1145/323596.323616
dblp:conf/podc/MosesDH85
fatcat:tazqs26p6ndrjikttflxthd7k4
Analysing Sanity of Requirements for Avionics Systems (Preliminary Version)
[article]
2015
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 usefulness of our completeness evaluation is demonstrated in a case study of an aeroplane control system. ...
In this work we build on the fact that functional requirements can be expressed in temporal logic and we propose new sanity checking techniques that automatically detect flaws and suggest improvements ...
The research leading to these results has received funding from the European Union's Seventh Framework Program (FP7/2007-2013) for CRYSTAL -Critical System Engineering Acceleration Joint Undertaking under ...
arXiv:1510.02669v1
fatcat:7td55isojrhyxcd5k4bqdcpxhu
A Preliminary Validation of the Polish Version of the Social Media Fatigue Scale
2021
Psychology Research and Behavior Management
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.
The Polish version of the SMFS presented satisfactory psychometric properties, showing many similarities with the original Chinese version of the SMFS. ...
The main aim of the study was to establish a latent structure of the Social Media Fatigue Scale (SMFS) and to identify whether the Polish version is congruent with the Chinese version. ...
After that, bilingual translators without prior knowledge of the questionnaire did three back-translations which were found to be in agreement with the source version. ...
doi:10.2147/prbm.s312897
pmid:34140816
pmcid:PMC8204136
fatcat:pyqcnifj4zepbfufck5uhfoewy
Planning in Knowledge Intensive Contexts: Systems Supporting Memory Tracing
2008
2008 3rd International Conference on Information and Communication Technologies: From Theory to Applications
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 order to take into account the temporal dimension of knowledge in plan generation, and not only in the plan itself, we designed MESS, a MEmory Support System able to sustain a dynamic representation ...
In this paper we discuss the theoretical environment we referred while designing MESS and describe the system architecture. ...
Aims and scopes MESS is a process memory support system designed according to two principles: • knowledge is not important in itself but it make sense in the underlying context of knowledge and in the ...
doi:10.1109/ictta.2008.4530316
fatcat:dqzo236bbjglfiumnzwpljig7u
A Preliminary Validation of the Chinese Version of the Information Technology Identity Scale
2022
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 2022; you can also visit the original URL.
The file type is application/pdf.
The Chinese version of the information technology identity scale presented satisfactory psychometric properties and shared many similarities with the original version. ...
The main aim of the study was to revise Carter's IT Identity Scale in the context of Chinese cultural background and to determine whether the Chinese version is congruent with the English version. ...
original and translated versions. ...
doi:10.2147/prbm.s352365
pmid:35368422
pmcid:PMC8965015
fatcat:yakvlhhkqndb7olzouix5llece
InterWeave: A Middleware System for Distributed Shared State
[chapter]
2000
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 2008; you can also visit the original URL.
The file type is application/pdf.
In InterWeave, each shared segment evolves through a series of consistent versions. ...
As an alternative to message passing, Rochester's InterWeave system allows the programmer to map shared segments into programs spread across heterogeneous, distributed machines. ...
In the version of the application that uses hand-written message passing, this knowledge is embedded in application source code. ...
doi:10.1007/3-540-40889-4_16
fatcat:5aa2v2kdtnan5cobnx2j6cdygm
Validation results of a self-maintained cardiology collaborative tool
2005
Computers in Cardiology, 2005
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.
This paper presents the results and lessons learnt from Health Memory (HM), a self-maintained multidisciplinary system that focuses on cardiology. ...
Excellence in care optimisation in modern cardiology is a twofold issue that involves both the collaboration of numerous communities that benefit from collaborative work spaces as well as life-long education ...
Acknowledgements This work has been performed in the framework of the IST project Health Memory (IST-2001-38181), which is partly funded by the European Commission. ...
doi:10.1109/cic.2005.1588081
fatcat:6ulfhsakxnfuzpd3tgr3xx2czy
Metatool 5.0: fast and flexible elementary modes analysis
2006
Bioinformatics
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 recent years, new approaches to calculating elementary modes in biochemical reaction networks have been developed. ...
The performance of Metatool has been significantly increased and the new version 5.0 can now be run inside the GNU octave or Matlab environments to allow more flexible usage and integration with other ...
The increase in speed and the reduction in memory requirements allows one to tackle larger reaction systems than before. ...
doi:10.1093/bioinformatics/btl267
pmid:16731697
fatcat:edwvfefr4fgudhiq7v32rpjas4
SPECTRE
2011
Proceedings of the Second Asia-Pacific Workshop on Systems - APSys '11
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 2012; you can also visit the original URL.
The file type is application/pdf.
We describe work in progress on the Spectre system which aims to provide high performance computing over distributed shared memory, targeting workloads such as graph algorithms for which functional or ...
We outline the Spectre design and provide preliminary results from a microbenchmark to motivate the approach. ...
The state of shared objects is managed using a transactional memory system in order to support aggressive speculation. ...
doi:10.1145/2103799.2103821
dblp:conf/apsys/MartinRI11
fatcat:u5uknv3mqbaipgmf5k655zscvq
Large Pheromones: A Case Study with Multi-agent Physical A*
[chapter]
2004
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 show that with this model of communication the behavior of a multi-agent system is almost as good as with complete knowledge sharing. ...
Previous work assumed a complete sharing of knowledge between agents. ...
Introduction This paper introduces the notion of large pheromones as a model of communication and global knowledge sharing in multi-agent systems. ...
doi:10.1007/978-3-540-28646-2_36
fatcat:log5s6opjjb55pds5ndekvdtcq
Preliminary Experiments with XKaapi on Intel Xeon Phi Coprocessor
2013
2013 25th International Symposium on Computer Architecture and High Performance 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 2013; you can also visit the original URL.
The file type is application/pdf.
associated runtime systems. ...
In that case, we observe substantial gains with up to 180 hardware threads over the state of the art MKL, with a 47% performance increase for 60 hardware threads. ...
Tasks share data if they have access to the same memory region. A memory region is defined as a set of addresses in the process virtual address space. ...
doi:10.1109/sbac-pad.2013.28
dblp:conf/sbac-pad/LimaBGR13
fatcat:i2ie22b7ubcahcj3p2g6dhuweq
« Previous
Showing results 1 — 15 out of 103,558 results