Results 1  10
of
3,462
The impact of imperfect scheduling on crosslayer congestion control in wireless networks
, 2005
"... In this paper, we study crosslayer design for congestion control in multihop wireless networks. In previous work, we have developed an optimal crosslayer congestion control scheme that jointly computes both the rate allocation and the stabilizing schedule that controls the resources at the under ..."
Abstract

Cited by 349 (32 self)
 Add to MetaCart
layer congestion control will be impacted if the network can only use an imperfect (and potentially distributed) scheduling component that is easier to implement. We study both the case when the number of users in the system is fixed and the case with dynamic arrivals and departures of the users, and we establish
Conventional FixedSchedule Versus Income Contingent Repayment Obligations: Is there a Best Loan Scheme?
"... Abstract: As more countries are planning to inaugurate or enlarge student loan schemes, much of the debate is over the question of the optimal form of the repayment obligation: specifically, whether it should be according to a fixed schedule of payments or a percentage or earnings or income. This pa ..."
Abstract
 Add to MetaCart
Abstract: As more countries are planning to inaugurate or enlarge student loan schemes, much of the debate is over the question of the optimal form of the repayment obligation: specifically, whether it should be according to a fixed schedule of payments or a percentage or earnings or income
High Speed Switch Scheduling for Local Area Networks
 ACM Transactions on Computer Systems
, 1993
"... Current technology trends make it possible to build communication networks that can support high performance distributed computing. This paper describes issues in the design of a prototype switch for an arbitrary topology pointtopoint network with link speeds of up to one gigabit per second. The s ..."
Abstract

Cited by 246 (3 self)
 Add to MetaCart
to the switch's operation is a technique called parallel iterative matching, which can quickly identify a set of conflictfree cells for transmission in a time slot. Bandwidth reservations are accommodated in the switch by building a fixed schedule for transporting cells from reserved flows across
On the capacity of MIMO broadcast channel with partial side information
 IEEE TRANS. INFORM. THEORY
, 2005
"... In multipleantenna broadcast channels, unlike pointtopoint multipleantenna channels, the multiuser capacity depends heavily on whether the transmitter knows the channel coefficients to each user. For instance, in a Gaussian broadcast channel with transmit antennas and singleantenna users, the ..."
Abstract

Cited by 349 (9 self)
 Add to MetaCart
to the transmitter with very little feedback. For fixed and increasing, the throughput of our scheme scales as log log, where is the number of receive antennas of each user. This is precisely the same scaling obtained with perfect CSI using dirty paper coding. We furthermore show that a linear increase in throughput
Weaknesses in the Key Scheduling Algorithm of RC4
 PROCEEDINGS OF THE 4TH ANNUAL WORKSHOP ON SELECTED AREAS OF CRYPTOGRAPHY
, 2001
"... In this paper we present several weaknesses in the key scheduling algorithm of RC4, and describe their cryptanalytic significance. We identify a large number of weak keys, in which knowledge of a small number of key bits suffices to determine many state and output bits with nonnegligible probabilit ..."
Abstract

Cited by 270 (1 self)
 Add to MetaCart
In this paper we present several weaknesses in the key scheduling algorithm of RC4, and describe their cryptanalytic significance. We identify a large number of weak keys, in which knowledge of a small number of key bits suffices to determine many state and output bits with non
APPROXIMATION ALGORITHMS FOR SCHEDULING UNRELATED PARALLEL MACHINES
, 1990
"... We consider the following scheduling problem. There are m parallel machines and n independent.jobs. Each job is to be assigned to one of the machines. The processing of.job j on machine i requires time Pip The objective is to lind a schedule that minimizes the makespan. Our main result is a polynomi ..."
Abstract

Cited by 265 (7 self)
 Add to MetaCart
polynomial algorithm which constructs a schedule that is guaranteed to be no longer than twice the optimum. We also present a polynomial approximation scheme for the case that the number of machines is fixed. Both approximation results are corollaries of a theorem about the relationship of a class of integer
Bandwidth Sharing: Objectives and Algorithms
 IEEE/ACM Transactions on Networking
, 1999
"... This paper concerns the design of distributed algorithms for sharing network bandwidth resources among contending flows. The classical fairness notion is the socalled maxmin fairness; F. Kelly [8] has recently introduced the alternative proportional fairness criterion; we introduce a third crit ..."
Abstract

Cited by 336 (11 self)
 Add to MetaCart
criterion, which is naturally interpreted in terms of the delays experienced by ongoing transfers. We prove that fixed size window control can achieve fair bandwidth sharing according to any of these criteria, provided scheduling at each link is performed in an appropriate manner. We next consider a
ENGcm07186 AIPS unalign causes abort on writes on internal register No fix scheduled 5
"... Chip Errata for the i.MX50 This document details the silicon errata known at the time of publication for the i.MX50 multimedia applications processors revision 1.1.1. Table 1 provides a revision history for this document. ..."
Abstract
 Add to MetaCart
Chip Errata for the i.MX50 This document details the silicon errata known at the time of publication for the i.MX50 multimedia applications processors revision 1.1.1. Table 1 provides a revision history for this document.
Finding the Minimal Number of Individuals Required to Meet a Fixed Schedule of Tasks References
"... The table below shows the required start and end times for ten tasks, as well as the minimum time it takes to reassign to task j an individual who has just completed task i. i bi ei Rij: Reassignment time from task i to task j (Minutes) Task Start End 1 2 3 4 5 6 7 8 9 10 1 1:00 p.m. 1:30 p.m. 6 ..."
Abstract
 Add to MetaCart
The table below shows the required start and end times for ten tasks, as well as the minimum time it takes to reassign to task j an individual who has just completed task i. i bi ei Rij: Reassignment time from task i to task j (Minutes) Task Start End 1 2 3 4 5 6 7 8 9 10 1 1:00 p.m. 1:30 p.m. 60 10 230 180 20 15 40 120 30 2 6:00 p.m. 8:00 p.m. 10 40 75 40 5 30 60 5 15
Power Conscious Fixed Priority Scheduling for Hard RealTime Systems
, 1999
"... Power efficient design of realtime systems based on programmable processors becomes more important as system functionality is increasingly realized through software. This paper presents a powerefficient version of a widely used fixed priority scheduling method. The method yields a power reduction b ..."
Abstract

Cited by 200 (5 self)
 Add to MetaCart
Power efficient design of realtime systems based on programmable processors becomes more important as system functionality is increasingly realized through software. This paper presents a powerefficient version of a widely used fixed priority scheduling method. The method yields a power reduction
Results 1  10
of
3,462