Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
2,767,703
A scheduling model for reduced CPU energy
- ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE
, 1995
"... The energy usage of computer systems is becoming an important consideration, especially for batteryoperated systems. Various methods for reducing energy consumption have been investigated, both at the circuit level and at the operating systems level. In this paper, we propose a simple model of job s ..."
Abstract
-
Cited by 550 (3 self)
- Add to MetaCart
scheduling aimed at capturing some key aspects of energy minimization. In this model, each job is to be executed between its arrival time and deadline by a single processor with variable speed, under the assumption that energy usage per unit time, P, is a convex function of the processor speed s. We give
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
, 1973
"... The problem of multiprogram scheduling on a single processor is studied from the viewpoint... ..."
Abstract
-
Cited by 3712 (2 self)
- Add to MetaCart
The problem of multiprogram scheduling on a single processor is studied from the viewpoint...
Static Scheduling of Synchronous Data Flow Programs for Digital Signal Processing
- IEEE TRANSACTIONS ON COMPUTERS
, 1987
"... Large grain data flow (LGDF) programming is natural and convenient for describing digital signal processing (DSP) systems, but its runtime overhead is costly in real time or cost-sensitive applications. In some situations, designers are not willing to squander computing resources for the sake of pro ..."
Abstract
-
Cited by 592 (37 self)
- Add to MetaCart
flow (SDF) differs from traditional data flow in that the amount of data produced and consumed by a data flow node is specified a priori for each input and output. This is equivalent to specifying the relative sample rates in signal processing system. This means that the scheduling of SDF nodes need
Trace Scheduling: A Technique for Global Microcode Compaction
- IEEE TRANSACTIONS ON COMPUTERS
, 1981
"... Microcode compaction is the conversion of sequential microcode into efficient parallel (horizontal) microcode. Local com-paction techniques are those whose domain is basic blocks of code, while global methods attack code with a general flow control. Compilation of high-level microcode languages int ..."
Abstract
-
Cited by 684 (5 self)
- Add to MetaCart
into efficient horizontal microcode and good hand coding probably both require effective global compaction techniques. In this paper "trace scheduling" is developed as a solution to the global compaction problem. Trace scheduling works on traces (or paths) through microprograms. Compacting is thus done
Object Recognition as Machine Translation: Learning a Lexicon for a Fixed Image Vocabulary
, 2002
"... We describe a model of object recognition as machine translation. In this model, ..."
Abstract
-
Cited by 606 (34 self)
- Add to MetaCart
We describe a model of object recognition as machine translation. In this model,
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 579 (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
Fast and robust fixed-point algorithms for independent component analysis
- IEEE TRANS. NEURAL NETW
, 1999
"... Independent component analysis (ICA) is a statistical method for transforming an observed multidimensional random vector into components that are statistically as independent from each other as possible. In this paper, we use a combination of two different approaches for linear ICA: Comon’s informat ..."
Abstract
-
Cited by 858 (34 self)
- Add to MetaCart
, and estimation of individual independent components as projection pursuit directions. The statistical properties of the estimators based on such contrast functions are analyzed under the assumption of the linear mixture model, and it is shown how to choose contrast functions that are robust and/or of minimum
Breaking and Fixing the Needham-Schroeder Public-Key Protocol using FDR
, 1996
"... In this paper we analyse the well known Needham-Schroeder Public-Key Protocol using FDR, a refinement checker for CSP. We use FDR to discover an attack upon the protocol, which allows an intruder to impersonate another agent. We adapt the protocol, and then use FDR to show that the new protocol is s ..."
Abstract
-
Cited by 716 (13 self)
- Add to MetaCart
's identity---they should become sure that they really are talking to each other, rather than to an intruder impersonating the other agent. This is the role of an authentication protocol. In this paper we use the Failures Divergences Refinement Checker (FDR) [11, 5], a model checker for CSP, to analyse
A simple approach to valuing risky fixed and floating rate debt
- Journal of Finance
, 1995
"... Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at ..."
Abstract
-
Cited by 588 (11 self)
- Add to MetaCart
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at
Results 1 - 10
of
2,767,703
