Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
11,502
DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors
- IEEE Transactions on Parallel and Distributed Systems
"... We present a low complexity heuristic named the Dominant Sequence Clustering algorithm (DSC) for scheduling parallel tasks on an unbounded number of completely connected processors. The performance of DSC is comparable or even better on average than many other higher complexity algorithms. We assume ..."
Abstract
-
Cited by 209 (11 self)
- Add to MetaCart
We present a low complexity heuristic named the Dominant Sequence Clustering algorithm (DSC) for scheduling parallel tasks on an unbounded number of completely connected processors. The performance of DSC is comparable or even better on average than many other higher complexity algorithms. We
Scalable Computing with Parallel Tasks
"... ABSTRACT Recent and future parallel clusters and supercomputers use SMPs and multi-core processors as basic nodes, providing a huge amount of parallel resources. These systems often have hierarchically structured interconnection networks combining computing resources at different levels, starting w ..."
Abstract
- Add to MetaCart
and by structuring the application in a way which is sensitive to the heterogeneous interconnect. In this article, we present an approach to structure the computations of an application as parallel tasks which can interact with other parallel tasks in communication phases. In particular, we consider how
On the Distribution of Parallel Tasks
, 1995
"... Introduction The growing popularityof distributed computing introduces increased competition between owners of workstations and programmers of parallel applications. This forces the introduction of a batch queuing system like DQS [1]. In section 2 we describe the utilization of a workstation cluste ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
cluster dedicated for PVM [2] applications in DQS. The central point is, that we neither have any privileges (e.g. root access) nor do PVM programmers have an account on this cluster. Nevertheless, usage is possible. Distributing parallel tasks in a more general environment than a dedicated workstation
The Power of Choice in Scheduling Parallel Tasks
, 1993
"... A malleable parallel task is one that can be executed on any number of processors, with its execution time being a function of the number of processors allotted to it. A nonmalleable parallel task is one that requires a specific number of processors. Given n independent parallel tasks and m identi ..."
Abstract
-
Cited by 6 (0 self)
- Add to MetaCart
A malleable parallel task is one that can be executed on any number of processors, with its execution time being a function of the number of processors allotted to it. A nonmalleable parallel task is one that requires a specific number of processors. Given n independent parallel tasks and m
Multilabel Classification in Parallel Tasks
"... In real world multilabel problems, it is often the case that e.g. documents are simultaneously classified with labels from multiple domains, such as genres in addition to topics. In practice, each of these problems is solved independently without taking advantage of possible label correlations betwe ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
between domains. Following the multi-task learning setting, in which multiple similar tasks are learned in parallel, we propose a global learning approach that jointly considers all domains. It is empirically demonstrated in this work that this approach is effective despite its simplicity when using a
Parallel task routing for crowdsourcing
- In HCOMP
, 2014
"... An ideal crowdsourcing or citizen-science system would route tasks to the most appropriate workers, but the best as-signment is unclear because workers have varying skill, tasks have varying difficulty, and assigning several workers to a single task may significantly improve output quality. This pap ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
. This paper defines a space of task routing problems, proves that even the simplest is NP-hard, and develops several approx-imation algorithms for parallel routing problems. We show that an intuitive class of requesters ’ utility functions is sub-modular, which lets us provide iterative methods
Parallel Task for parallelising object-oriented desktop applications
, 2009
"... Parallel Task for parallelising object-oriented desktop applications ..."
Scheduling Parallel Tasks Approximation Algorithms
, 2003
"... Scheduling is a crucial problem in parallel and distributed processing. It consists in determining where and when the tasks of parallel programs will be executed. The design of parallel algorithms has to be reconsidered by the influence of new execution supports (namely, clusters of workstations, gr ..."
Abstract
-
Cited by 13 (0 self)
- Add to MetaCart
Scheduling is a crucial problem in parallel and distributed processing. It consists in determining where and when the tasks of parallel programs will be executed. The design of parallel algorithms has to be reconsidered by the influence of new execution supports (namely, clusters of workstations
Parallel Networks that Learn to Pronounce English Text
- COMPLEX SYSTEMS
, 1987
"... This paper describes NETtalk, a class of massively-parallel network systems that learn to convert English text to speech. The memory representations for pronunciations are learned by practice and are shared among many processing units. The performance of NETtalk has some similarities with observed h ..."
Abstract
-
Cited by 549 (5 self)
- Add to MetaCart
This paper describes NETtalk, a class of massively-parallel network systems that learn to convert English text to speech. The memory representations for pronunciations are learned by practice and are shared among many processing units. The performance of NETtalk has some similarities with observed
On the control of automatic processes: A parallel distributed processing account of the Stroop effect
- Psychological Review
, 1990
"... Traditional views of automaticity are in need of revision. For example, automaticity otten has been treated as an all-or-none phenomenon, and traditional ~es have held that automatic processes are independent of attention. Yet recent empirical data suggest that automatic processes are continu-ous, a ..."
Abstract
-
Cited by 511 (45 self)
- Add to MetaCart
, and furthermore are subject to attentional control. A model of attention is presented to address these issues. Within a parallel distributed processing framework, it is proposed that the attributes of automaticity depend on the strength of a processing pathway and that strength increases with train-ing
Results 1 - 10
of
11,502
