1994
DOI: 10.1155/1995/656010
|View full text |Cite
|
Sign up to set email alerts
|

Language Constructs for Data Partitioning and Distribution

Abstract: This article presents a survey of language features for distributed memory multiprocessor systems (DMMs), in particular, systems that provide features for data partitioning and distribution. In these systems the programmer is freed from consideration of the low-level details of the target architecture in that there is no need to program explicit processes or specify interprocess communication. Programs are written according to the shared memory programming paradigm but the programmer is required to specify, by… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
6
0

Year Published

1996
1996
2007
2007

Publication Types

Select...
3
2
1

Relationship

1
5

Authors

Journals

citations
Cited by 7 publications
(6 citation statements)
references
References 34 publications
0
6
0
Order By: Relevance
“…By reducing the communications to a level low, synchronous methods such as the Ring Algorithm for decentralized networks can be applied. 15,16,18 The number of coordination stages in our approach is more than the MILP algorithm (which has only one main coordination stage at the beginning of the game). However, compared to the ordinary MILP approaches, the computation time required is much less for most situations.…”
Section: B Decentralizationmentioning
confidence: 99%
“…By reducing the communications to a level low, synchronous methods such as the Ring Algorithm for decentralized networks can be applied. 15,16,18 The number of coordination stages in our approach is more than the MILP algorithm (which has only one main coordination stage at the beginning of the game). However, compared to the ordinary MILP approaches, the computation time required is much less for most situations.…”
Section: B Decentralizationmentioning
confidence: 99%
“…To reduce the communications to a level low enough, synchronous methods such as the Ring Algorithm for decentralized networks can be applied [15][16][17][18].…”
Section: Decentralizationmentioning
confidence: 99%
“…Different varieties of this problem such as the lion-man 1 1 1-4244-0525-4/07/$20.00 ©2007 IEEE. 2 IEEEAC paper #1420, Version 4, Updated on Dec. 15,2006 problem [2] in which a pursuer tries to catch a same-speed evader in a bounded space, pursuit-evasion in polygonal environments, and pursuit-evasion in polygonal environments with a door [3] are studied. In real-world applications, algorithms such as randomized search [4] and level sets [5] are used to calculate applicable numerical control strategies for one or both players.…”
Section: Introductionmentioning
confidence: 99%
“…For the cases where each platform (pursuer or evader) has only partial information of the battlefield, additional communication operations will be required so that all team members have the same level of information. To reduce the communications to a level low enough, synchronous methods such as Ring Algorithm for decentralized networks can be applied [15][16][17][18].…”
Section: B Framework Of Decentralization Approachmentioning
confidence: 99%