scholarly journals Locality-Conscious Lock-Free Linked Lists

2011 ◽  
pp. 107-118 ◽  
Author(s):  
Anastasia Braginsky ◽  
Erez Petrank
Keyword(s):  
Linked Lists

An Investigation of Vector and Parallel Processing Applied to Solid Modeling

1996 ◽  
Author(s):  
Navin Pai ◽  
Mark Henderson
Keyword(s):  
Data Structure ◽  
Parallel Processing ◽  
Solid Modeling ◽  
Boundary Representation ◽  
Solid Modeler ◽  
Linked Lists

Abstract Solid modeling is a very useful industrial tool in the manufacture and design of industrial parts and assemblies. As a tool in the industrial workplace it has to be able to respond quickly to changes in design. To do this, the intersection algorithms between the solids have to be speeded up. Optimizations such as vector and parallel processing traditionally supported by supercomputers have the potential to solve this problem. A solid modeler was developed based on the boundary representation approach using a half-edge data structure. Those parts of the solid modeler code that could be vectorized were identified. A method was tested which allows loops involving linked lists to vectorize. It was also shown that this solid modeler has an inherent parallelism that can be exploited. Results are presented for vectorization and parallelization. The practical limits to both vectorization and parallelization are highlighted. Improvements to the geometric intersections algorithms are suggested to take advantage of vector and parallel processing. Results of the speedups possible using these algorithms are presented.

scholarly journals Deconstructing Linked Lists

2019 ◽  
Vol 8 (2S8) ◽  
pp. 655-658
Keyword(s):  
Present Status ◽  
Local Area ◽  
Extreme Programming ◽  
Von Neumann ◽  
Current Scenario ◽  
Linked Lists

The refinement of e-commerce has visual-ized Internet QoS, and current scenario suggest that the exploration of local-area net-works will soon emerge. Given the present status of simultaneous approaches, scholars broadly want the affirmed unification of von Neumann machines and extreme programming. So as to fathom this issue, we utilize secure epistemologies to dis-demonstrate that Smalltalk can be made versatile, particular, and versatile

Checking Cleanness in Linked Lists

2000 ◽  
pp. 115-134 ◽  
Author(s):  
Nurit Dor ◽  
Michael Rodeh ◽  
Mooly Sagiv
Keyword(s):  
Linked Lists

Verification of Attributes in Linked Lists Using Ant Colony Metaphor

2010 ◽  
pp. 220-228
Author(s):  
Soumya Banerjee ◽  
P. K. Mahanti
Keyword(s):  
Data Structure ◽  
Ant Colony Algorithm ◽  
Predicate Logic ◽  
Device Driver ◽  
Ant Colony ◽  
Linked List ◽  
Exploration Strategy ◽  
Local Propagation ◽  
Learning Parameter ◽  
Linked Lists

The chapter describes the validation of the attributes of linked list using modified pheromone biased model (of Ant colony) under complex application environment mainly for kernel configuration and device driver operations. The proposed approach incorporates the idea of pheromone exploration strategy with small learning parameter associated while traversing a linked list. This process of local propagation on loop and learning on traversal is not available with the conventional validation mechanism of data structure using predicate logic. It has also been observed from simulation that the proposed ant colony algorithm with different pheromone value produces better convergence on linked list.

Linked lists: The role of locking

2021 ◽  
pp. 201-228
Author(s):  
Maurice Herlihy ◽  
Nir Shavit ◽  
Victor Luchangco ◽  
Michael Spear
Keyword(s):  
Linked Lists
Sign in / Sign up

Export Citation Format

Share Document