Richard P. Feynman. The Feynman lectures on computation. AddisonWesley Publishing Company, Reading, MA, 1996. edited by A.J.G. Hey and R. W. Allen.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....Austria e mail: svozil tuwien.ac.at Sir Quantum information is radically di erent from classical information in that the quantum formalism makes necessary the introduction of irreducible nits, n being an arbitrary natural number. As pointed out many times by Landauer and others (e.g. [1, 2]) the formal concept of information is tied to physics, at least as far as applicability is a concern. Thus it should come as no surprise that quantum mechanics requires fundamentally new concepts of information as compared to the ones appropriate for classical physics. And indeed, research into ....

Richard P. Feynman. The Feynman lectures on computation. AddisonWesley Publishing Company, Reading, MA, 1996. edited by A.J.G. Hey and R. W. Allen.

....a large end point store is searched to find the destination end point and when datagram end point matching rules allow exhaustive store searches. UDP performance gains are of particular interest because UDP s transport services are utilized by some of the Internet s most heavily used applications. [3, 13] We describe UDP s unicast datagram demultiplexing using the destination host model shown in Figure 1. Arriving Datagram Stream Kernel Space User Space User Processes Communication End point Store UDP IP Figure 1. Destination host model for UDP datagram demultiplexing. Our model assumes ....

....typical UDP IP datagram processing also takes place. 1.2 BSD s UDP and Pcb Implementations BSD derived UDP implementations use protocol control blocks (pcbs) as communication end points and manage the pcbs using a circular linked list store combined with a one behind cached pcb pointer. 2 [13] Traditionally, in pcblookup is the kernel function that performs the pcb list search. This function matches the source and destination IP addresses and port numbers (these foreign and local sockets make up the tag) of a just arrived packet with the foreign and local sockets of a pcb; the pcb ....

[Article contains additional citation context not shown here]

Gary R. Wright and W. Richard Stevens, TCP/IP Illustrated, Volume 2: The Implementation, AddisonWesley Publishing Company, 1995.

....PROBLEM ALGORITHM LANGUAGE MACHINE REPRESENTATION Figure 2. Mapping from Problem to Machine Representation. ############################################# During the 1960s and early 1970s, a great deal of attention was focused on scheduling problems that emerged in a manufacturing environment [CoM67]. These problems were predominantly deterministic as the arrival time of jobs requiring service, and the duration of service were exactly known. Scheduling problems that emerge in computer systems are nondeterministic because exact information about resource requirements is rarely available. ....

....problem specification from the solution. The separation allows a clearer comparison of scheduling strategies for a given problem, and avoids confusing a strategy and a problem. Three classifications of scheduling problems are discussed in this section. First is Conway and Miller s classification [CoM67], a four parameter scheme where the categories are: A: the job arrival process which for static arrivals indicates the number, and for dynamic arrivals indicates the probability distribution of the time between arrivals, B: the number of machines in the shop, C: the flow pattern in the shop, D: ....

[Article contains additional citation context not shown here]

R. W. Conway, W. L. Maxwell, and L. W. Miller, Theory of Scheduling, AddisonWesley Publishing Company, Reading, Massachusetts, 1967.

....that minimizes mean response time is shortest remaining processing time rst (SRPT) In addition to SRPT, there are many algorithms in the literature which are designed for the case where the task size is known. Good overviews of the single node scheduling problem and its solution are given in [7], 14] and [17] In our work we focus on servers that serve static content, i.e. les whose size can be determined in advance. Web servers can serve dynamic content as well; in this case our methods are less directly applicable. However, recent measurements have suggested that most servers ....

Richard W. Conway, William L. Maxwell, and Louis W. Miller. Theory of Scheduling. AddisonWesley Publishing Company, 1967.

....policies can be approximated by Processor Sharing (PS) as explained in Section 1. There are many algorithms in the literature which are designed for the case where the task size is known. Good overviews of the single node scheduling problem and its optimal solution are given in [14] 11] and [6]. Despite the fact that the file sizes are typically available to the Web server, very little work has considered size based scheduling in the Web. One paper that does discuss size based scheduling in the Web is that of Bender, Chakrabarti, and Muthukrishnan, 5] This paper raises an important ....

Richard W. Conway, William L. Maxwell, and Louis W. Miller. Theory of Scheduling. AddisonWesley Publishing Company, 1967.

....mean response time is shortest remaining processing time first (SRPT) In addition to SRPT, there are many algorithms in the literature which are designed for the case where the task size is known. Good overviews of the single node scheduling problem and its solution are given in [18] 15] and [7]. Despite the fact that the file sizes are typically available to the Web server, very little work has considered size based scheduling in the Web. One paper that does discuss size based scheduling in the Web is that of Bender, Chakrabarti, and Muthukrishnan [6] This paper raises an important ....

Richard W. Conway, William L. Maxwell, and Louis W. Miller. Theory of Scheduling. AddisonWesley Publishing Company, 1967.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC