Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
6,121
An Operation Placement and Scheduling Scheme for Cache and
- in Proc. of Int'l Symposium on Parallel Architectures, Algorithms and Networks
, 1997
"... With increasing on-chip hardware, concurrency is a way to bridge the gap between the computational power demanded by the applications and that afforded by the computer platforms. Although parallel systems are increasingly popular, they remain very difficult to program. In fact, most compilers requir ..."
Abstract
- Add to MetaCart
whenever possible, since it is cheaper, faster, and less power hungry than global communication. In order to exploit these locality properties, we present a systematic operation placement and scheduling scheme for fine-grain parallel architectures. The key advantages are two folds: (1) This multiprojection
Software pipelining: An effective scheduling technique for VLIW machines
, 1988
"... This paper shows that software pipelining is an effective and viable scheduling technique for VLIW processors. In software pipelining, iterations of a loop in the source program are continuously initiated at constant intervals, before the preceding iterations complete. The advantage of software pipe ..."
Abstract
-
Cited by 581 (3 self)
- Add to MetaCart
This paper shows that software pipelining is an effective and viable scheduling technique for VLIW processors. In software pipelining, iterations of a loop in the source program are continuously initiated at constant intervals, before the preceding iterations complete. The advantage of software
Trapezoid Self-Scheduling: A Practical Scheduling Scheme for Parallel Compilers
, 1993
"... In this paper, we present a new practical processor self-scheduling scheme, Trapezoid Self-Scheduling, for arbitrary parallel nested loops in shared-memory multiprocessors. Generally, loops are the richest source of parallelism in parallel programs. To dynamically allocate loop iterations to process ..."
Abstract
-
Cited by 96 (4 self)
- Add to MetaCart
In this paper, we present a new practical processor self-scheduling scheme, Trapezoid Self-Scheduling, for arbitrary parallel nested loops in shared-memory multiprocessors. Generally, loops are the richest source of parallelism in parallel programs. To dynamically allocate loop iterations
Observation scheduling scheme for Subaru telescope
, 1996
"... Optimization of observation sequences is a function necessary to get high efficiency and reliability of observations. We are now implementing scheduling software into the observation software system for Subaru telescope. The scheduling engine, SPIKE, developed at STScI is used with some modification ..."
Abstract
- Add to MetaCart
Optimization of observation sequences is a function necessary to get high efficiency and reliability of observations. We are now implementing scheduling software into the observation software system for Subaru telescope. The scheduling engine, SPIKE, developed at STScI is used with some
Implementation of Distributed Loop Scheduling Schemes on the TeraGrid
"... Grid computing can be used for high performance computations. However, a serious difficulty in concurrent programming of such heterogeneous systems is how to deal with scheduling and load balancing of such systems which may consist of heterogeneous computers on different sites. Distributed schedulin ..."
Abstract
-
Cited by 8 (2 self)
- Add to MetaCart
scheduling schemes suitable for parallel loops with independent iterations on heterogeneous computer clusters have been proposed and analyzed in the past. Here, we implement the previous schemes in MPICH-G2 and MPIg on the TeraGrid. We present performance results for three loop scheduling schemes on single
An Optimal Scheduling Scheme for Tiling in Distributed Systems
"... Abstract — There exist several scheduling schemes for parallelizing loops without dependences for shared and distributed memory systems. However, efficiently parallelizing loops with dependences is a more complicated task. This becomes even more difficult when the loops are executed on a distributed ..."
Abstract
- Add to MetaCart
Abstract — There exist several scheduling schemes for parallelizing loops without dependences for shared and distributed memory systems. However, efficiently parallelizing loops with dependences is a more complicated task. This becomes even more difficult when the loops are executed on a
A Multi-Buffer Scheduling Scheme for Video Streaming
- IEEE International Conference on Multimedia and Expo (ICME
"... In this paper, we propose a multi-buffer scheduling scheme for streaming video systems. A transmission rate is obtained via a rate control algorithm, which optimally utilizes the network bandwidth and client buffer resources. The server side maintains multiple buffers for packets of different import ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
In this paper, we propose a multi-buffer scheduling scheme for streaming video systems. A transmission rate is obtained via a rate control algorithm, which optimally utilizes the network bandwidth and client buffer resources. The server side maintains multiple buffers for packets of different
Distributed Loop Scheduling Schemes for Cloud Systems
"... Abstract—Cloud computing infrastructure offers the com-puting resources as a homogeneous collection of virtual ma-chine instances by different hardware configurations, which is transparent to end users. In fact, the computational powers of these virtual machine instances are different and behaves as ..."
Abstract
- Add to MetaCart
as a heterogeneous environment. Thus, scheduling and load balancing for high performance computations become challeng-ing on such systems. In this paper, we propose a hierarchical distributed scheduling scheme suitable for parallel loops with independent iterations on a cloud computing system. We also
A Heuristic Scheduling Scheme in Multiuser OFDMA Networks
, 2008
"... Abstract—Conventional heterogeneous-traffic scheduling schemes utilize zero-delay constraint for real-time services, which aims to minimize the average packet delay among real-time users. However, in light or moderate load networks this strategy is unnecessary and leads to low data throughput for no ..."
Abstract
- Add to MetaCart
Abstract—Conventional heterogeneous-traffic scheduling schemes utilize zero-delay constraint for real-time services, which aims to minimize the average packet delay among real-time users. However, in light or moderate load networks this strategy is unnecessary and leads to low data throughput
Distributed Scheduling Schemes for Throughput Guarantees in Wireless Networks
"... Wireless networks differ from their wireline counterparts in that a group of simultaneously active wireless links interfere with each other. This interference between links significantly complicates the scheduling component in wireless systems. This is especially problematic in multi-hop wireless ..."
Abstract
- Add to MetaCart
interference models in the literature along with distributed scheduling schemes that can provide provable throughput guarantees under those models. A detailed analysis of the communication overhead is provided for the scheduling schemes, and the results indicate that this overhead can significantly impact
Results 1 - 10
of
6,121
