A general framework for prefetch scheduling in linked data structures and its application to multi-chain prefetching

2004 ◽  
Vol 22 (2) ◽  
pp. 214-280 ◽  
Author(s):  
Seungryul Choi ◽  
Nicholas Kohout ◽  
Sumit Pamnani ◽  
Dongkeun Kim ◽  
Donald Yeung
Keyword(s):  
Data Structures ◽  
Linked Data ◽  
General Framework

scholarly journals A Logic of Reachable Patterns in Linked Data-Structures

2006 ◽  
pp. 94-110 ◽  
Author(s):  
Greta Yorsh ◽  
Alexander Rabinovich ◽  
Mooly Sagiv ◽  
Antoine Meyer ◽  
Ahmed Bouajjani
Keyword(s):  
Data Structures ◽  
Linked Data

Towards a Lexically Oriented Automatic Parsing

1991 ◽  
Vol 15 (1) ◽  
pp. 1-40
Author(s):  
Lucio Costa
Keyword(s):  
Artificial Intelligence ◽  
Distributed Control ◽  
Data Structures ◽  
General Framework ◽  
Computational Models ◽  
The Other ◽  
Sono Stati ◽  
Use Context ◽  
And Linguistics ◽  
Context Free

RIASSUNTO La ricerca sul linguaggio naturale condotta in Intelligenza Artificiale si è sviluppata, malgrado le apparenze, in modo alquanto indipendente dal la-voro dei linguisti. Da un lato sono stati elaborati modelli computazionali delle facoltà di lunguaggio che si configurano come largamente autonomi rispetto a quelli sviluppati in linguistica. D'altro lato, l'implementazione dei sistemi è stata influenzata da soluzioni pragmatiche connesse all'efficacia computazionale delle regole indipendenti dal contesto, alla necessità di evitare componenti trasformazionali inversi e ad una concezione rappresenta-zionale del significato. Il presente articolo propone l'interesse dei lavori lin-guistici di Z. S. Harris e M. Gross ai fini dello sviluppo di un'analisi sintat-tica automatica che sia a controllo diffuso e incentrata sul comportamento idiosincratico delle unità lessicali. Essa è anche inquadrata nel tentativo di gettare luce sulla natura del processo denotazionale. SUMMARY In spite of the claim on the interactions between artificial intelligence (AI) and linguistics, AI research on natural language has developed independently from the work of linguists. On one hand, computational models of the faculties of language which are independent from the models developed in linguistics have been worked out. On the other hand, the AI system design has been oriented towards practical solutions, whose main motivations where to use context-free rules, to avoid an inverse transformational component, and to represent meanings by some data structures. This paper is about the linguistic works of Z.S. Harris and M. Gross to develop automatic distributed control parsing which takes seriously into account the indiosyncratic behaviour of the lexical items. The general framework for the discussion is the procedural nature of the denotational process.

Estimating Effective Prefetch Distance in Threaded Prefetching for Linked Data Structures

2012 ◽  
Vol 40 (5) ◽  
pp. 465-487 ◽  
Author(s):  
Yan Huang ◽  
Zhi-Min Gu ◽  
Jie Tang ◽  
Min Cai ◽  
Jianxun Zhang ◽  
...  
Keyword(s):  
Data Structures ◽  
Linked Data

scholarly journals Pattern-Based Verification of Programs with Extended Linear Linked Data Structures

2006 ◽  
Vol 145 ◽  
pp. 113-130 ◽  
Author(s):  
Milan Češka ◽  
Pavel Erlebach ◽  
Tomáš Vojnar
Keyword(s):  
Data Structures ◽  
Linked Data

scholarly journals Timed Automata May Cause Some Troubles

2002 ◽  
Vol 9 (35) ◽  
Author(s):  
Patricia Bouyer
Keyword(s):  
Data Structures ◽  
General Framework ◽  
Timed Automata ◽  
Exact Computation ◽  
Analysis Algorithm ◽  
Forward Analysis

Timed automata are a widely studied model. Its decidability has been proved using the so-called region automaton construction. This construction provides a correct abstraction for the behaviours of timed automata, but it does not support a natural implementation and, in practice, algorithms based on the notion of zones are implemented using adapted data structures like DBMs. When we focus on forward analysis algorithms, the exact computation of all the successors of the initial configurations does not always terminate. Thus, some abstractions are often used to ensure termination, among which, a widening operator on zones.<br /> <br />In this paper, we study in details this widening operator and the forward analysis algorithm that uses it. This algorithm is most used and implemented in tools like Kronos and Uppaal. One of our main results is that it is hopeless to find a forward analysis algorithm, that uses such a widening operator, and which is correct. This goes really against what one could think. We then study in details this algorithm in the more general framework of updatable timed automata, a model which has been introduced as a natural syntactic extension of classical timed automata. We describe subclasses of this model for which a correct widening operator can be found.

Sign in / Sign up

Export Citation Format

Share Document