Výsledky vyhľadávania - "Parallel algorithms and applications"
-
1
Path-history-based access control for mobile agents
ISSN: 1744-5760, 1744-5779Vydavateľské údaje: Taylor & Francis Group 01.06.2006Vydané v International journal of parallel, emergent and distributed systems (01.06.2006)“…The mobility of agents is a distinct characteristic of mobile agent systems. Meanwhile, it has introduced new security issues. In this paper, we analyze the…”
Získať plný text
Journal Article -
2
On mobile transaction processing in dynamically configurable mobile database communities
ISSN: 1744-5760, 1744-5779Vydavateľské údaje: Taylor & Francis Group 01.06.2006Vydané v International journal of parallel, emergent and distributed systems (01.06.2006)“…The topology of a mobile ad hoc network (MANET) may change randomly and rapidly at an unpredictable time, since nodes are free to move arbitrarily. In such an…”
Získať plný text
Journal Article -
3
Context adaptation of the communication stack
ISSN: 1744-5760, 1744-5779Vydavateľské údaje: Taylor & Francis Group 01.06.2006Vydané v International journal of parallel, emergent and distributed systems (01.06.2006)“…This paper presents a middleware framework to support the development of context-aware adaptive communication protocols stacks. The protocol stacks can be…”
Získať plný text
Journal Article -
4
A middleware architecture for mobile 3D graphics
ISSN: 1744-5760, 1744-5779Vydavateľské údaje: Taylor & Francis Group 01.06.2006Vydané v International journal of parallel, emergent and distributed systems (01.06.2006)“…Mobile graphics, which involves running networked computer graphics applications on mobile devices across wireless networks, is a fast growing segment of the…”
Získať plný text
Journal Article -
5
FPGA implementation of a Cholesky algorithm for a shared-memory multiprocessor architecture
ISSN: 1063-7192Vydavateľské údaje: Taylor & Francis GroupAbingdon, UK 01.12.2004Vydané v Parallel algorithms and applications (01.12.2004)“…Solving a system of linear equations is a key problem in engineering and science. Matrix factorization is a key component of many methods used to solve such…”
Získať plný text
Journal Article -
6
On the double-vertex-cycle-connectivity of crossed cubes
ISSN: 1063-7192Vydavateľské údaje: Taylor & Francis GroupAbingdon, UK 01.03.2004Vydané v Parallel algorithms and applications (01.03.2004)“…Crossed cube, a variation of hypercube, is a candidate for the interconnection network topology employed in parallel computing systems due to nearly half…”
Získať plný text
Journal Article -
7
A Parallel four points modified explicit group algorithm on shared memory multiprocessors
ISSN: 1063-7192Vydavateľské údaje: Taylor & Francis GroupAbingdon, UK 01.03.2004Vydané v Parallel algorithms and applications (01.03.2004)“…The four points modified explicit group (MEG) method for solving 2D Poisson equation was introduced by Othman and Abdullah ["An efficient Four Points Modified…”
Získať plný text
Journal Article -
8
Deadlock-free dynamic reconfiguration over InfiniBand™ NETWORKS
ISSN: 1063-7192Vydavateľské údaje: Taylor & Francis GroupAbingdon, UK 01.06.2004Vydané v Parallel algorithms and applications (01.06.2004)“…InfiniBand Architecture (IBA) is a newly established general-purpose interconnect standard applicable to local area, system area and storage area networking…”
Získať plný text
Journal Article -
9
A comparative study of explicit group iterative solvers on a cluster of workstations
ISSN: 1063-7192Vydavateľské údaje: Taylor & Francis GroupAbingdon, UK 01.12.2004Vydané v Parallel algorithms and applications (01.12.2004)“…In this paper, a group iterative scheme based on rotated (cross) five-point finite difference discretisation, i.e. the four-point explicit decoupled group…”
Získať plný text
Journal Article -
10
HP Java: Programming Support for High-Performance Grid-Enabled Applications
ISSN: 1063-7192Vydavateľské údaje: Taylor & Francis GroupAbingdon, UK 01.06.2004Vydané v Parallel algorithms and applications (01.06.2004)“…The paper begins by considering what a grid computing environment might be, why it is demanded and how the authors' HP spmd programming fits into this picture…”
Získať plný text
Journal Article -
11
Fast and scalable parallel matrix computations with reconfigurable pipelined optical buses
ISSN: 1063-7192Vydavateľské údaje: Taylor & Francis GroupAbingdon, UK 01.12.2004Vydané v Parallel algorithms and applications (01.12.2004)“…We present fast and highly scalable parallel computations for a number of important and fundamental matrix problems on linear arrays with reconfigurable…”
Získať plný text
Journal Article -
12
Defects in parallel Monte Carlo and quasi-Monte Carlo integration using the leap-frog technique
ISSN: 1063-7192Vydavateľské údaje: Taylor & Francis Group 01.05.2003Vydané v Parallel algorithms and applications (01.05.2003)“…Currently, the most efficient numerical techniques for evaluating high-dimensional integrals are based on Monte Carlo and quasi-Monte Carlo techniques. These…”
Získať plný text
Journal Article -
13
Application of MPI-IO in Parallel Particle Transport Monte-Carlo Simulation
ISSN: 1063-7192Vydavateľské údaje: Taylor & Francis GroupAbingdon, UK 01.12.2004Vydané v Parallel algorithms and applications (01.12.2004)“…Parallel computers are increasingly being used to run large-scale applications that also have huge input/output (I/O) requirements. However, many applications…”
Získať plný text
Journal Article -
14
Trinomial-tree Based Parallel Option Price Valuations
ISSN: 1063-7192Vydavateľské údaje: Taylor & Francis GroupAbingdon, UK 01.12.2003Vydané v Parallel algorithms and applications (01.12.2003)“…We examine how trinomial-tree based computations such as those involved in American or European-style option price valuations can be performed in parallel…”
Získať plný text
Journal Article -
15
Fault tolerant algorithms for a linear array with a reconfigurable pipelined bus system
ISSN: 1063-7192Vydavateľské údaje: Taylor & Francis Group 01.09.2003Vydané v Parallel algorithms and applications (01.09.2003)“…Recently, researchers have proposed many models using reconfigurable optically pipelined buses. All algorithms developed for these models assume that a healthy…”
Získať plný text
Journal Article -
16
A portable Software Architecture for Mesh-Independent Particle Tracking Algorithms
ISSN: 1063-7192Vydavateľské údaje: Taylor & Francis GroupAbingdon, UK 01.06.2004Vydané v Parallel algorithms and applications (01.06.2004)“…Particle tracking methods are central to a wide spectrum of scientific computing applications. To support such applications, this paper presents a compact…”
Získať plný text
Journal Article -
17
A Distributed Normalized Explicit Preconditioned Conjugate Gradient Method
ISSN: 1063-7192Vydavateľské údaje: Taylor & Francis GroupAbingdon, UK 01.06.2004Vydané v Parallel algorithms and applications (01.06.2004)“…A new parallel normalized explicit preconditioned conjugate gradient method in conjunction with normalized approximate inverse matrix techniques is presented…”
Získať plný text
Journal Article -
18
o(log4 n) time parallel maximal matching algorithm using linear number of processors
ISSN: 1063-7192Vydavateľské údaje: Taylor & Francis GroupAbingdon, UK 01.03.2004Vydané v Parallel algorithms and applications (01.03.2004)“…Computing maximal matching of a graph having n vertices in parallel within time using a linear number of processors on the EREW-PRAM is an open problem [Karp,…”
Získať plný text
Journal Article -
19
Cost-effective modeling for natural resource distribution systems
ISSN: 1063-7192Vydavateľské údaje: Taylor & Francis GroupAbingdon, UK 01.12.2004Vydané v Parallel algorithms and applications (01.12.2004)“…Pipe systems are in the cores of many real life applications including water, oil and gas distribution as well as air-conditioning and compressed air…”
Získať plný text
Journal Article -
20
The Journal of Parallel Algorithms and Applications: Special Issue on Parallel and Distributed Algorithms: Guest Editors' Editorial
ISSN: 1063-7192Vydavateľské údaje: Taylor & Francis GroupAbingdon, UK 01.06.2004Vydané v Parallel algorithms and applications (01.06.2004)Získať plný text
Journal Article