
	Where results make sense

Topic: Algorithms for Recovery and Isolation Exploiting Semantics

Related Topics

Emily Browning

Pulse dialing

Secretin

Archie Hahn

In the News (Fri 17 Feb 12)

EXECUTIVE POWER

Iran

ANALYSIS

Pakistan

Family compact

	Algorithms for Recovery and Isolation Exploiting Semantics - Wikipedia, the free encyclopedia
		In computer science, Algorithms for Recovery and Isolation Exploiting Semantics, or ARIES is a recovery algorithm designed to work with a no-force, steal database approach.
		ARIES is a popular algorithm used by IBM DB2, Microsoft SQL Server and many other database systems.
		Write ahead logging: Any change to an object is first recorded in the log, and the log must be written to stable storage before changes to the object are written to disk.
	en.wikipedia.org /wiki/Algorithms_for_Recovery_and_Isolation_Exploiting_Semantics (206 words)

	[No title]
		Recovery related overhead is particularly troublesome in an environment where a large volatile memory is used.
		Three iterative algorithms were utilized in the experiments: solution of Laplace equations, the calculation of the invariant distribution of Markov chains, and the solution of systems of linear equations.
		Fault-tolerant versions of those algorithms were implemented with two general techniques for fault tolerance (triplication with voting and checkpointing and rollback) and three application-specific techniques for fault tolerance (self stabilization, algorithm-based fault tolerance, and natural redundancy).
	www.cs.utexas.edu /ftp/pub/techreports/INDEX/index-1992 (5685 words)

	Daftar algoritma - Wikipedia Indonesia, ensiklopedia bebas berbahasa Indonesia
		Snapshot algorithm: a snapshot is the process of recording the global state of a system
		Rainflow-counting algorithm: Reduces a complex stress history to a count of elementary stress-reversals for use in fatigue analysis
		LR parser: A more complex linear time parsing algorithm for a larger class of context-free grammars.
	id.wikipedia.org /wiki/Daftar_algoritma (1192 words)

	Facts about semantics (Site not responding. Last check: 2007-10-23)
		In general, Semantics (from the Greek semantikos, or "significant meaning," derived from "sema," sign) always refers to some kind of meaning (of something that is written) and is thus usually opposed to syntax, which refers to the formal way in which something is written.
		Semantics is a subfield of linguistics that is traditionally defined as the study of meaning.
		Semantics is also a branch of formal logic, alongside Grammar, Proof Theory, and Applications.
	www.supercrawler.com /Facts/semantics.html (175 words)

	Algorithm Design
		Algorithms for Recovery and Isolation Exploiting Semantics - In computer science, Algorithms for Recovery and Isolation Exploiting Semantics, or ARIES is a recovery algorithm designed to work with a no-force, steal database approach.
		Algorithm Design, Analysis algorithm design and Implementation is unique in its coverage of both approaches to presenting algorithms: according to problem type algorithm design and according to design technique.
		This book explores the design algorithm design and implementation of algorithms in sufficient detail to provide an understanding of the relationship between design concepts algorithm design and implementation, equipping readers with the basic tools needed to develop their own algorithms, in whatever field of application they may require.
	www.lepcoinc.com /algorithmdesign.html (946 words)

	SIGMOBILE - PhD Theses
		A distributed dynamic channel allocation algorithm that adapts to spatial and temporal fluctuations in channel demand is presented.
		A message optimal algorithm for recording a global state of a system with causal message ordering is presented.
		Conventional algorithms for causal message ordering cannot be used directly for mobile systems due to their energy constraints.
	www.sigmobile.org /phd/9697/theses_abstracts_96.html (3260 words)

	Technical Report Abstracts
		In traditional database management systems, recovery activities like checkpointing and restart, are performed in a quiescent state where no transactions are active.
		This report deals with a parallel algorithmic technique that has proved to be very useful in the design of efficient parallel algorithms for several problems on undirected graphs.
		In order to ensure the simplicity of recovery in an object-based database system environment, the notion of a strict history containing operations that are semantically richer than read and write operations is of vital importance.
	www.cs.utexas.edu /ftp/pub/techreports/INDEX/html/Abstracts.1992.html (7858 words)

	Simulation/evaluation environment for a VLIW processor architecture
		Processors capable of exploiting ILP contain multiple functional units, fetch several instructions per cycle from the instruction cache, and in a given cycle may dispatch multiple operations for execution.
		A trap handler is invoked, activating recovery code generated by the compiler, which re-executes the out-of-order load instruction as well as those instructions that depend on it and were executed before the trap was generated.
		Primitive instructions in a tree are subject to sequential semantics for each path, as if each primitive instruction were executed in the order in which it appears in the tree path (a tree path starts from the root of the tree and ends in a destination target).
	www.research.ibm.com /journal/rd/413/moreno.html (8020 words)

	[No title]
		The resulting semantics for non-monotonic reasoning, called the acceptability semantics, is based on the view that this type of reasoning can be seen as a task of choosing appropriate subsets of knowledge from a "pool" of typically contradictory knowledge.
		The semantics of the integrated framework is defined by suitably combining the central notions of abductive explanation in ALP and constraint solving in CLP.
		Our motivation is to exploit the advantages of fuzzy logic control such as ability to quickly express the control structure of a system using apriori knowledge in linguistic terms, less dependence on the availability of a precise model of the controlled system, and easy handling of the inherent nonlinearities.
	www.cs.ucy.ac.cy /webPages/RESEARCH/res.htm (13864 words)

	[arrangementer] IBM Fellow Visit (Site not responding. Last check: 2007-10-23)
		The man who invented the ARIES recovery algorithm is visiting DIKU on July 19th.
		With the B+tree, and 2-phase locking, the ARIES algorithm is one of the achievements of the database research community that has the greatest industrial impact.
		ARIES supports fuzzy checkpoints, selective and deferred restart, fuzzy image copies, media recovery, and high concurrency lock modes (e.g., increment/decrement) which exploit the semantics of the operations and which require the ability to perform operation logging.
	www.diku.dk /web-tjenester/mailman/arrangementer/2004-July/000309.html (375 words)

	Workflow-based applications
		Thus, it is only natural to exploit workflow technology for the implementation of fork structures, that is, for encapsulating the ordering of operations.
		If the work associated with an activity cannot be successfully completed semantically, or when the results produced by a collection of activities are detected to be incorrect, the WFMS should undo the already-processed coupled activities and start the affected parts of the business process again.
		At the operational level, each implementation of an activity within an atomic sphere is required to exploit only resource managers in the sense of Reference 38 and does not provide its own end-of-transaction processing.
	researchweb.watson.ibm.com /journal/sj/361/leymann.html (9799 words)

	The Adapt Framework for Adaptable and Composable Web Services (Site not responding. Last check: 2007-10-23)
		ACID" transactional semantics, the resulting CS could not have the same: it has long been realised that not all interactions can be structured as ACID transactions.
		With this approach, the task of developing a replication algorithm is factored into two portions: the framework itself, which handles all the detailed interactions with the underlying application server code, and the specific replication algorithm, which is written in terms of a high-level API and is plugged into the framework.
		Online recovery at the application server layer is relatively simple to achieve, because the amount of state to be transferred is sufficiently "small" and it can be kept in main memory.
	dsonline.computer.org /portal/site/dsonline/menuitem.9ed3d9924aeb0dcd82ccc6716bbe36ec/index.jsp?&pName=dso_level1&path=dsonline/topics/was/papers&file=bartoli.xml&xsl=article.xsl& (6737 words)

	:: Computer Science and Engineering :: (Site not responding. Last check: 2007-10-23)
		Since it is difficult to enforce traditional ACID (atomicity, consistency, isolation, and durability) properties for the execution of such processes, ensuring the semantic correctness of concurrent process execution and recovery techniques is a challenge for service-oriented computing.
		A semantic partition of a web document is a hierarchical representation of all of its concepts, instances, and attributes with their values.
		The research explores the feasibility of exploiting dynamic reconfiguration to ensure the reliable consuming and composition of services such that, they are adaptable to changing environment to meet the functional and non-functional requirements at runtime in real-time.
	www.eas.asu.edu /~csedept/news/defenses/2004.php (6223 words)

	Department of Computer and Information Science and Engineering (Site not responding. Last check: 2007-10-23)
		Randomized algorithms have become popular in other branches of CS because of their speed improvement over many of the best sequential algorithms.
		The derivation of a distributed mutual exclusion algorithm is given to illustrate the method on a non-trivial example.
		Inspired by our experiences with Wang's algorithm, one goal of the paper is to demonstrate that the process of formalization together with careful attention to abstraction and presentation can yield significant benefits in algorithm design.
	www.cise.ufl.edu /tech_reports/tr96 (5297 words)

	Course Descriptions - Fa98
		Description: Algorithms for NLP is an introductory graduate-level course on the computational properties of natural languages and the fundamental algorithms for processing natural languages.
		For example, a denotational semantics is automatically compositional, while typically this is not the case for an operational semantics; nevertheless one can usually still justify modular program analysis in the operational style, although the style of semantic presentation tends to make it harder.
		As is traditional in semantics texts and research, we work not with ``real'' programming languages like C and Standard ML, but instead we focus on small ``core'' languages with an idealized (and simplified) syntax.
	www-2.cs.cmu.edu /~burks/courses/fa98/descriptions.html (7003 words)

	Citations: Aries: A transaction recovery method supporting fine-granularity locking and partial rollbacks using ... (Site not responding. Last check: 2007-10-23)
		The case study demonstrates the need for different policies and hence different recovery protocols and mechanisms depending on the size of the objects, frequency of access, and the system architecture, to list a few....
		The current state of the art in recovery, however, presents an interesting paradox: ffl On the one hand, there is considerable experience in building systems that successfully support recovery.
		recovery algorithm which obviates the need for log sequence numbers (LSNs) to be included on every page.
	citeseer.ist.psu.edu /cs?q=dbnum=1,GID=897,DID=0,start=50,cluster=none,qtype=context: (3733 words)

	DCS: Abstracts and Bios
		The setting with partitionable networks is especially challenging, as algorithmic solutions must accommodate the possibility that groups of communicating processors become disconnected (and, perhaps, reconnected) during the computation.
		The efficiency of task-performing algorithms is often assessed in terms of work: the total number of tasks, counting multiplicities, performed by all of the processors during the computation.
		As the ``semantic gap'' between high-level (and global) policies and low-level (and highly localized) enforcement actions seems particularly large, we believe that a good choice of abstraction coupled to a set of translation tools can have significant operational impact on system security.
	www.ics.forth.gr /dcs/Activities/Colloquia/abstractsANDbios.html (9257 words)

	Seminar 2003-04 abstracts
		In this talk, I present a simple and efficient method, called ARIES (Algorithm for Recovery and Isolation Exploiting Semantics), which supports partial rollbacks of transactions, fine-granularity (e.g., record) locking and recovery using write-ahead logging (WAL).
		ARIES supports fuzzy checkpoints, selective and deferred restart, fuzzy backups, media recovery, and high concurrency lock modes (e.g., increment/decrement) which exploit the semantics of the operations and which require the ability to perform operation logging.
		I show why some of the System R paradigms for logging and recovery, which were based on the shadow page technique, need to be changed in the context of WAL.
	research.ac.upc.edu /HPCseminar/SEM0304/abs.html (2879 words)

	[No title]
		Algorithms are founded on the fusion of execution traces.
		We use trace fusion algorithms for everything that requests a synchronous view of several user modifications including the synchronous visualization of divergence between users modifying asynchronously copies of the same object.
		Concerning concurrency between processes, the idea is, in opposition with the state of the art which mainly founds atomicity on isolation, to take advantage of the structure and the semantics of processes to increase the synergy and the parallelism between processes.
	www.inria.fr /rapportsactivite/RA2005/ecoo/ecoo.xml (5801 words)

	Unknown (ResearchIndex)
		Abstract: In some database applications the traditional approach of serializability, in which transactions appear to execute atomically and in isolation on a consistent database state, fails to satisfy performance requirements.
		Although many researchers have investigated the process of decomposing transactions into steps to increase concurrency, such research typically focuses on providing algorithms necessary to implement a decomposition supplied by the database application developer and pays...
		134 Using semantic knowledge for transaction processing in a dis..
	citeseer.ist.psu.edu /461369.html (366 words)

	Impact of ARIES Family of Locking and Recovery Algorithms - C. Mohan
		This page is devoted to tracking information on the ARIES (Algorithms for Recovery and Isolation Exploiting Semantics) family of locking, logging and recovery algorithms for persistent data management.
		There are new algorithms which provide concurrency control for B-tree indices, recovery compatible with fine-grained locking, and concurrency control allowing long-running audits.
		New algorithms for database recovery and rollbacks are described.
	www.almaden.ibm.com /u/mohan/ARIES_Impact.html (4464 words)

	Extendible, Long-Lived Transaction Processing on Distributed and Mobile Environments with Recovery Guarantees ... (Site not responding. Last check: 2007-10-23)
		4 Using semantic knowledge for transaction processing in a dis..
		4 A study of the concurrency control and recovery algorithms i..
		3 Synchronization and recovery in a clientserver storage syste..
	citeseer.ifi.unizh.ch /696783.html (1375 words)

	Current and Recent Projects
		Error isolation is harder in a tightly coupled system -- any failure of a disk, processor or memory, or any system software failure brings down the entire system.
		Furthermore, within a constant factor, an on-line LRU type memory management algorithm will work as well as off-line memory management: programmers can be effectively relieved of the need to explicitly copy data from one storage location to another.
		It is possible to come up with examples of transformations that would be correct when applied to each sequential thread in isolation, but that lead to an incorrect result when the threads execute concurrently and communicate via shared variables, due to violations of the shared memory semantics (we assume sequential consistency).
	www.cs.uiuc.edu /homes/snir/research.html (3195 words)

	The Aries Project
		In the ARIES project, my goal was to create a simple runtime environment in which the student can implement the Algorithms for Recovery and Isolation Exploiting Semantics (ARIES) protocol for transactions, write-ahead logging, and restart recovery, as invented by C. Mohan and others.
		I invite you to evaluate the source and assignments and use this curriculum in your course.
		I believe that this project is suitable for Seniors and first-year graduate students in computer science in a course that dedicates more than 5 weeks to transaction proccessing concepts, such as write-ahead logging, recovery, concurrency control, transaction semantics, data placement, and commit protocols.
	hssl.cs.jhu.edu /~randal/aries/aries.php (558 words)

	Network-Embedded Programmable Storage and Its Applications
		A checksum-search algorithm is used to identify such portions when the two versions are not located on the same machine.
		The tree is constructed using a minimum-spanning tree algorithm on a graph where the nodes are Stones and the edges are weighted with the inverse of pair-wise bandwidth.
		Of course, we are not advocating that this is the only coherence semantics that one should implement--it just happens to be one of the desirable semantics that makes collaboration easy.
	www.cs.princeton.edu /~sobti/papers/networking04/stone (7597 words)

	Course Descriptions - Spring 99
		A semantics for a programming language is a mathematical model that reflects the intended computational behavior of programs.
		Semantics can help to clarify the picture by allowing us to make rigorous statements about properties of programs and the interactions between program constructs.
		In each case, we will show how a semantics can be used to analyze individual programs, to design correct programs, and to prove general laws of program equivalence that can be used to simplify programs while preserving correctness.
	www.cs.cmu.edu /~burks/courses/sp99/desc.html (4197 words)

Try your search on: Qwika (all wikis)