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.
Filters
Transition and Halting Modes in (Tissue) P Systems
[chapter]
2010
Lecture Notes in Computer Science
Preserved Fulltext
In this paper, the definitions of the most important transition modes and halting modes are explained based on networks of cells, a general model for tissue P systems. ...
Moreover, some results for specific variants of tissue P systems working on multisets of objects are recalled. ...
Acknowledgements I am very grateful to the coauthors of those papers from which most of the definitions and results have been taken for this paper, especially to Artiom Alhazov, Marion Oswald, and Sergey ...
doi:10.1007/978-3-642-11467-0_3
fatcat:vxuggoii5vbejm6szcr6qmtsge
How derivation modes and halting conditions may influence the computational power of P systems
2019
Journal of Membrane 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 2020; you can also visit the original URL.
The file type is application/pdf.
modes and the maximally parallel set derivation modes, on the generative and accepting power are illustrated. ...
Furthermore, besides the standard total halting, we also consider different halting conditions such as unconditional halting and partial halting and explain how the use of different halting conditions ...
Many of the ideas for this paper came up in the inspiring atmosphere of the Brainstorming Week on Membrane Computing in Sevilla 2019 and even in some previous years, and they are based on many discussions ...
doi:10.1007/s41965-019-00028-9
fatcat:yv6bzvlavvgejpbblodlm6cb3u
Why a single parallelization strategy is not enough in knowledge bases
1989
Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems - PODS '89
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 propose several parallehzation strategies based on the concept of data reduction-the original logic program is evaluated by several processors working in parallel, each using only a subset of the database ...
The strategies differ on the evaluation cost, the overhead of communication and synchronization among processors, and the programs to which they are applicable. ...
The csl program defines a tuple (a, b) to be in S, if and only if there is a path from a to b having k UP arcs, one FLAT arc, and k DOWN arcs, for some integer k. ...
doi:10.1145/73721.73742
dblp:conf/pods/CohenW89
fatcat:b535ap2vnjbizpzrafykfawdmq
Why a single parallelization trategy is not enough in knowledge bases
1993
Journal of computer and system sciences (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 2017; you can also visit the original URL.
The file type is application/pdf.
We propose several parallehzation strategies based on the concept of data reduction-the original logic program is evaluated by several processors working in parallel, each using only a subset of the database ...
The strategies differ on the evaluation cost, the overhead of communication and synchronization among processors, and the programs to which they are applicable. ...
The csl program defines a tuple (a, b) to be in S, if and only if there is a path from a to b having k UP arcs, one FLAT arc, and k DOWN arcs, for some integer k. ...
doi:10.1016/0022-0000(93)90019-s
fatcat:mxgli6tfv5ajramk6j36yyu4ki
On Reversibility and Determinism in P Systems
[chapter]
2010
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 2009; you can also visit the original URL.
The file type is application/pdf.
Membrane computing is a formal framework of distributed parallel computing. In this paper we study the reversibility and maximal parallelism of P systems from the computability point of view. ...
The universality is shown for one class and a negative conjecture is stated for a more restricted class of reversible P systems. ...
He also acknowledges the support by the Science and Technology Center in Ukraine, project 4032. ...
doi:10.1007/978-3-642-11467-0_12
fatcat:tjzz5vpzvvdulfuia226h4wlky
Investigations on Natural Computing in the Institute of Mathematics and Computer Science
2010
Computer Science Journal of Moldova
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 describe the investigations on natural computing in the Institute of Mathematics and Computer Science of the Academy of Sciences of Moldova during last fifteen years. ...
Most of these investigations are inspired by results and ideas belonging to Corresponding Member of the Romanian Academy Gheorghe Paun. ...
Acknowledgments All authors acknowledge the support by the Science and Technology Center in Ukraine, project 4032. ...
doaj:4a41c2dcf8c14619bd127cda0ee90e72
fatcat:oytiwwjjlzdabc7om5h7mkatla
A survey of parallel execution strategies for transitive closure and logic programs
1993
Distributed and parallel databases
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.
Data fragmentation plays an important role in obtaining parallel execution; we describe hash-based and semantic fragmentation. ...
Finally, we consider Datalog queries, and present general methods for parallel rule execution; we recognize the similarities between these methods and the methods reviewed previously, when the former are ...
Stefano Ceri is partially supported by Esprit Project P6333, IDEA and the research of Maurice Houtsma has been made possible by a fellowship of the Royal Netherlands Academy of Arts and Sciences. ...
doi:10.1007/bf01264013
fatcat:pe4vicsr3vctzoj437towrkdv4
Graph Management Systems: A Qualitative Survey
2020
APTIKOM Journal on Computer Science and Information Technologies
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 first ones consider end-to-end data management issues including storage representations, transactions, and query languages, whereas the second ones focus on processing specific tasks over large data ...
.), and many systems have been developed to manage, query, and analyze these datasets. These systems could be divided into specialized graph database systems and large-scale graph analytics systems. ...
The Traversal API is a framework that allows one to build traversal rules without sacrificing any of the power of graph traversal, in a simple and declarative manner and with minimal performance impact ...
doi:10.34306/csit.v5i1.132
fatcat:wttmyaeuzvadpnrfrnawjvq46y
Abstracts of Current Computer Literature
1968
IEEE transactions on computers
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 analysis is not based on any specific type of parallel processor; its purpose is rather to see if parallel capabilities could be used effectively in matrix inversion. ...
These parameters are a generalization of don't care conditions and may be assigned arbitrary values so as to minimize the cost of realizing the functions. ...
doi:10.1109/tc.1968.229105
fatcat:2ijvliiwarh2jc2lxnwiyktyjq
On the computational capabilities of physical systems part II: relationship with conventional computer science
[article]
2000
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.
Analogues of Chomsky hierarcy results concerning universal Turing Machines and the Halting theorem are derived, as are results concerning the (im)possibility of certain kinds of error-correcting codes. ...
This second paper of the pair elaborates the mathematical structure and impossibility results associated with physical computation. ...
A TM is a device that takes in an input string on an input tape, then based on it produces a sequence of output strings, either "halting" at some time with a final output string, or never halting. ...
arXiv:physics/0005059v1
fatcat:umoafcb7mrguhpkemyttipey44
Communication-minimal partitioning of parallel loops and data arrays for cache-coherent distributed-memory multiprocessors
[chapter]
1997
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.
The compiler implements a solution to the open problem of finding communication-minimal partitions of loops and data. ...
A good loop partition maximizes the cache hit rate while a good data partition minimizes remote cache misses. ...
Thus, even if L's footprints and D partially overlap at the origin, there will be less overlap on other processors. ...
doi:10.1007/bfb0017263
fatcat:jxqgujgm45a5nekrv7a3qdsuu4
A software-based MPEG-4 video encoder using parallel processing
1998
IEEE transactions on circuits and systems for video technology (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 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we describe a software-based MPEG-4 video encoder which is implemented using parallel processing on a cluster of workstations collectively working as a virtual machine. ...
Index Terms-Data partitioning, dynamic scheduling, load balancing, MPEG-4, parallel and distributed processing, Petri nets, video encoder. ...
In our shape-adaptive partitioning method, the initial separated subregion may have an arbitrary shape to minimize the imbalances. ...
doi:10.1109/76.735385
fatcat:7dcouels7zc3hcfdsqxbzsiroq
Graph-based data mining
2000
IEEE Intelligent Systems and their 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.
Acknowledgments Our work was supported by NSF grant IRI-9615272 and THECB grant 003656-045. ...
In our approach, we partition the data among n individual processors and process each partition in parallel. 9 Each processor performs the sequential version of Subdue on its local graph partition and ...
Requiring a minimal amount of communication and using PVM (Parallel Virtual Machine) for communication, distributed Subdue is available for widespread use and runs on a variety of heterogeneous distributed ...
doi:10.1109/5254.850825
fatcat:uhmbej7osncgndxkc7rbyvvtmi
High-Level Programming Abstractions for Distributed Graph Processing
2018
IEEE Transactions on Knowledge and Data 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.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2016 pre-print arXiv:1607.02646v1 fatcat:hxyyqj445rhovfy7kdsziopgb4
Several high-level programming abstractions have been proposed and adopted by distributed graph processing systems and big data platforms. ...
In this survey, we review and analyze the most prevalent high-level programming models for distributed graph processing, in terms of their semantics and applicability. ...
If the partitioning technique used creates well-connected subgraphs and minimizes edge cuts between partitions, it is highly probable that a partition-centric implementation will require less communication ...
doi:10.1109/tkde.2017.2762294
fatcat:m5luctm3yjhapbbdrgjcernbbm
Distributed XML processing: Theory and applications
2008
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 2008; you can also visit the original URL.
The file type is application/pdf.
PASS is based on a network of automata, where PASS-nodes independently but cooperatively process parts of the SOAP message XML payload. ...
These properties ensure minimal distributed processing management overhead. ...
Our prefix based approach to XML processing can be used to generate the algorithms used by each thread for arbitrary partition of the XML document into sub-trees to be processed in parallel. ...
doi:10.1016/j.jpdc.2008.04.003
fatcat:tsdyyx5jdjg2bi3uk6z4gg524a
« Previous
Showing results 1 — 15 out of 5,048 results