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
.
Filters
Parallel computing in information retrieval – an updated review
1997
Journal of Documentation
More information on various architectures can be found in Rasmussen [1]. A. DAP (Distributed Array of Processors). The AMT (formally ICL) DAP is a SIMD class architecture. ...
The architecture has a Master Control Unit (MCU) which broadcasts instructions and data to the array to work on and also obtains the results from the array. ...
We are grateful to Ephraim Vishniac and Dennis Parkinson for information on various aspects of the CM-2 and DAP systems described in this paper. ...
doi:10.1108/eum0000000007201
fatcat:2zuwtehixbd6xk33hwb3j43nse
CUDAMPF++: A Proactive Resource Exhaustion Scheme for Accelerating Homologous Sequence Search on CUDA-enabled GPU
2018
IEEE Transactions on Parallel and Distributed Systems
In addition, we propose a novel method that proactively sacrifices L1 Cache Hit Ratio (CHR) to get improved performance and scalability in return. ...
In this paper, we propose a five-tiered parallel framework, CUDAMPF++, to accelerate the most computationally intensive stages of HMMER3's pipeline, multiple/single segment Viterbi (MSV/SSV), on a single ...
ACKNOWLEDGMENTS The authors would like to thank the NVIDIA-Professor partnership for generous donations in carrying out this research. ...
doi:10.1109/tpds.2018.2830393
fatcat:64ug5j2vrnftnfh3e233oyint4
A distributed control path architecture for VLIW processors
2005
14th International Conference on Parallel Architectures and Compilation Techniques (PACT'05)
In this paper, we propose a distributed control path architecture for VLIW processors (DVLIW) to overcome the scalability problem of VLIW control paths. ...
The architecture simplifies the dispersal of complex VLIW instructions and supports efficient distribution of instructions through a limited bandwidth interconnect, while supporting compressed instruction ...
A3 B3 C3 D3 ... A1 A0 A2 A3 B0 B1 B2 B3 C0 C1 C2 C3 D0 D2 D3 ... D1 (b) (a) The proposed branch mechanism is based on the unbundled branch architecture in HPL-PD [15] . ...
doi:10.1109/pact.2005.5
dblp:conf/IEEEpact/ZhongFMS05
fatcat:j6lo66yhp5dufhcpnot4s4fziu
Object management in local distributed systems
1988
Journal of Systems and Software
the data needed, and completing and reviewing the collection of information. ...
Respondents should be aware that notwithstanding any other provision of law, no person shall be subject to a penalty for failing to comply with a collection of information if it does not display a currently ...
In particular, we are not interested in multiprocessor systems characterized by shared memories, or computers connected by wide-area networks because such networks are usually slow, thus making it impractical ...
doi:10.1016/0164-1212(88)90012-x
fatcat:jdjca4qlsvdfjpuqbhj43iwyh4
Object Management in Local Distributed Systems
[chapter]
1987
Kommunikation in Verteilten Systemen
the data needed, and completing and reviewing the collection of information. ...
Respondents should be aware that notwithstanding any other provision of law, no person shall be subject to a penalty for failing to comply with a collection of information if it does not display a currently ...
In particular, we are not interested in multiprocessor systems characterized by shared memories, or computers connected by wide-area networks because such networks are usually slow, thus making it impractical ...
doi:10.1007/978-3-642-71655-3_18
dblp:conf/kivs/ZhouZ87
fatcat:ffr42nvpvvc3dj6yhnfhdxnzja
Supporting Lock-Free Composition of Concurrent Data Objects: Moving Data between Containers
2013
IEEE transactions on computers
This move operation allows data to be transferred from one container to another, in a lock-free way, without blocking any of the operations supported by the original container. ...
They have also been shown to work well in practice. ...
Requirement 2) There is nothing shared between instances of the object, so the insert and remove operations can succeed simultaneously. ...
doi:10.1109/tc.2012.248
fatcat:qf2rvbcqrzahhjtsiqanjw3eju
Big Graph Analytics Platforms
2017
Foundations and Trends in Databases
In the storage layer, a dynamic graph is stored in a distributed key/value store among a set of graph nodes. ...
efficient physical query plan that can be evaluated in on a shared-nothing cluster for the Pregel logical plan. ...
For a highdegree vertex v, its adjacency list may not fit into a single page, and thus TurboGraph stores the adjacency list using multiple pages, which are also tracked by the in-memory page table. ...
doi:10.1561/1900000056
fatcat:ucqrtzo4q5g2lpj6dmp7jv3e5m
A Dataflow-Based Scientific Workflow Composition Framework
2012
IEEE Transactions on Services Computing
In this paper, we propose a dataflow-based scientific workflow composition framework consisting of: i) a dataflow-based scientific workflow model that separates the declaration of the workflow interface ...
Although several scientific workflow management systems (SWFMSs) have been developed, a formal scientific workflow composition model in which workflow constructs are fully compositional one with another ...
Ram for his collaborative work on the Tan-goInSilico biological simulation project, which is used for the case study presented in this paper. ...
doi:10.1109/tsc.2010.58
fatcat:nxby26r4rndwxgpugbrtzgmviy
Secure Image Hiding Algorithm using Cryptography and Steganography
2013
IOSR Journal of Computer Engineering
In the present scenario, any communication of internet and networks application requires security.Lots of data security and data hiding algorithms have been developed in the last decade.Cryptography and ...
steganography are the two major techniques for secret communication.In this paper,the secret image is first encrypted by using BLOWFISH algorithm which has very good performance and is a most powerful ...
Valunjkar, Director In-Charge, NIELIT centre, Aurangabad. ...
doi:10.9790/0661-1350106
fatcat:ufv3vx7pd5banok7b5eh7bup7y
A Novel Cache Architecture and Placement Framework for Packet Forwarding Engines
2009
IEEE transactions on computers
Performance results reveal that our HSCA scheme results in a 32% speedup in average memory access time over a unified nodes cache. ...
Also, HSCA outperforms IHARC, a cache for lookup results, with as high as a 10 fold speedup in average memory access time. ...
Most algorithms used for LPM make use of a trie data structure to store the contents of the routing table [4] , [29] . ...
doi:10.1109/tc.2009.18
fatcat:sf2ymhqdfzco5cxhrheqnrkd7a
Self-adjustment of resource allocation for grid applications
2008
Computer Networks
Fig. 1 illustrates the various phases in the execution of a grid application, with the bottom left showing the steps needed for scheduling. ...
j o u r n a l h o m e p a g e : w w w . e l s e v i e r . c o m / l o c a t e / c o m n e t 2. ...
This work was supported in part by ProNEx-FAPESP/CNPq, CNPq and FAPESP Kyatera. ...
doi:10.1016/j.comnet.2008.03.002
fatcat:nuopgpkntbantkqzz4mz7fb56i
Final Statements
[chapter]
2009
FPGA-Based Implementation of Signal Processing Systems
A number of other people have also acted to contribute in many other ways to either provide technical input or support. These ...
The authors would like to thank Richard Walke and John Gray for motivating a lot of the work at Queen's University Belfast on FPGA. ...
In addition to this, some slices, called SLICEM, support two additional functions: storing data using distributed RAM and shifting data with 32-bit registers. ...
doi:10.1002/9780470713785.ch14
fatcat:b5uyg6k2qbhnncscazm2ickxki
Workshop on Practical Use of Coloured Petri Nets and Design/CPN: Aarhus, Denmark, 10-12 June 1998
1998
DAIMI Report Series
The papers are also available in electronic form via the CPN Web pages at University of Aarhus: http://www.daimi.au.dk/CPnets/ ...
The Coloured Petri nets dynamic nature can be used to follow the path of execution of a real-time system, without the cost and effort of building a test system. ...
A special thank to Kurt Jensen for his help in structuring this paper. Acknowledgements. We w ould like to thank Lars Michael Kristensen for his help in writing this paper. ...
doi:10.7146/dpb.v27i532.7649
fatcat:6etzboywojbbjidwfpcyxh2br4
Probabilistic Analysis of Power and Temperature Under Process Variation for Electronic System Design
2014
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
These representations allow for a computationally efficient estimation of the probability distributions and accompanying quantities of the power and temperature characteristics of the system. ...
In this work, we propose a flexible probabilistic framework targeted at the quantification of the transient power and temperature variations of an electronic system. ...
The null hypothesis that the data are from an unspecified Gaussian distribution was firmly rejected in both cases at the significance level of 5%. ...
doi:10.1109/tcad.2014.2301672
fatcat:kfgrllfhozgubpmfmp4b35pzjm
REVERSE ENGINEERING – THE REVIEW
2016
International Journal of Advance Engineering and Research Development
It also contains two additional kinds of objects: data-stores and control activities. Data-stores are for representing database, data variables and data structures. ...
Delta compression Delta compression is a way of storing data in the form of differences between sequential data rather than complete files. ...
A Use Case model [15] describes: • the system to be constructed, Since the repository stores information in the form of a file system tree, the abstract set used here to model this is DirSet, WrokFiles ...
doi:10.21090/ijaerd.030476
fatcat:llzg42pevjhhrgssvlllgoy3zq
« Previous
Showing results 1 — 15 out of 74 results