The Network as a Storage Device: Dynamic Routing with Bounded Buffers

We study dynamic routing in store-and-forward packet networks where each network link has bounded buffer capacity for receiving incoming packets and is capable of transmitting a fixed number of packets per unit of time. At any moment in time, packets are injected at various network nodes with each packet specifying its destination node. The goal is to maximize the throughput, defined as the number of packets delivered to their destinations. In this paper, we make some progress on throughput maximization in various network topologies. Let n and m denote the number of nodes and links in the network, respectively. For line networks, we show that Nearest-to-Go (NTG), a natural distributed greedy algorithm, is -competitive, essentially matching a known lower bound on the performance of any greedy algorithm. We also show that if we allow the online routing algorithm to make centralized decisions, there is a randomized polylog(n)-competitive algorithm for line networks as well as for rooted tree networks, where each packet is destined for the root of the tree. For grid graphs, we show that NTG has a competitive ratio of while no greedy algorithm can achieve a ratio better than . Finally, for arbitrary network topologies, we show that NTG is -competitive, improving upon an earlier bound of O(mn). An extended abstract appeared in the Proceedings of the 8th Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2005, Berkeley, CA, USA, pp. 1–13, Lecture Notes in Computer Science, vol. 1741, Springer, Berlin. S. Angelov is supported in part by NSF Career Award CCR-0093117, NSF Award ITR 0205456 and NIGMS Award 1-P20-GM-6912-1. S. Khanna is supported in part by an NSF Career Award CCR-0093117, NSF Award CCF-0429836, and a US-Israel Binational Science Foundation Grant. K. Kunal is supported in part by an NSF Career Award CCR-0093117 and NSF Award CCF-0429836.     

A general distributed scalable grid scheduler for independent tasks

We consider non-preemptively scheduling a bag of independent mixed tasks (hard, firm and soft) in computational grids. Based upon task type, we construct a novel generalized distributed scheduler (GDS) for scheduling tasks with different priorities and deadlines. GDS is scalable and does not require knowledge of the global state of the system. It is composed of several phases: a multiple attribute ranking phase, a shuffling phase, and a task-resource matched peer to peer dispatching phase. Results of exhaustive simulation demonstrate that with respect to the number of high-priority tasks meeting deadlines, GDS outperforms existing approaches by 10%–25% without degrading schedulability of other tasks. Indeed, with respect to the total number of schedulable tasks meeting deadlines, GDS is slightly better. Thus, GDS not only maximizes the number of mission-critical tasks meeting deadlines, but it does so without degrading the overall performance. The results have been further confirmed by examining each component phase of GDS. Given that fully known global information is time intensive to obtain, the performance of GDS is significant. GDS is highly scalable both in terms of processors and number of tasks—indeed it provides superior performance over existing algorithms as the number of tasks increase. Also, GDS incorporates a shuffle phase that moves hard tasks ahead improving their temporal fault tolerance. Furthermore, since GDS can handle mixed task types, it paves the way to open the grid to make it amenable for commercialization. The complexity of GDS is O(n²m)$O\left(n^{2}m\right)$ where n$n$ is the number of tasks and m$m$ the number of machines.     

Appearance Derivatives for Isonormal Clustering of Scenes

A new technique is proposed for scene analysis, called "appearance clustering.” The key result of this approach is that the scene points can be clustered according to their surface normals, even when the geometry, material, and lighting are all unknown. This is achieved by analyzing an image sequence of a scene as it is illuminated by a smoothly moving distant light source. In such a scenario, the brightness measurements at each pixel form a "continuous appearance profile.” When the source path follows an unstructured trajectory (obtained, say, by smoothly hand-waving a light source), the locations of the extrema of the appearance profile provide a strong cue for the scene point's surface normal. Based on this observation, a simple transformation of the appearance profiles and a distance metric are introduced that, together, can be used with any unsupervised clustering algorithm to obtain isonormal clusters of a scene. We support our algorithm empirically with comprehensive simulations of the Torrance-Sparrow and Oren-Nayar analytic BRDFs, as well as experiments with 25 materials obtained from the MERL database of measured BRDFs. The method is also demonstrated on 45 examples from the CURET database, obtaining clusters on scenes with real textures such as artificial grass and ceramic tile, as well as anisotropic materials such as satin and velvet. The results of applying our algorithm to indoor and outdoor scenes containing a variety of complex geometry and materials are shown. As an example application, isonormal clusters are used for lighting-consistent texture transfer. Our algorithm is simple and does not require any complex lighting setup for data collection.     

Low cycle fatigue,fatigue crack propagation and substructures in a series of polycrystalline Cu-Al alloys

Low Cycle Fatigue (LCF) on smooth hour glass specimens and Fatigue Crack Propagation (FCP) studies on Single Edge Notch (SEN) specimens were carried out at room temperature on four Cu-Al polycrystalline alloys to investigate the effects of Stacking Fault Energy (SFE) and mechanical property variations on fatigue characteristics. Significant improvements in fatigue properties were observed for alloys of low SFE. A microhardness technique was used to delineate the fatigue plastic zone ahead of stopped cracks at several stress intensity ranges for all the alloys. Planar slip was associated with a less than a second power dependence of plastic zone size on the stress intensity range. Transmission Electron Microscopy (TEM) was used to observe the substructures that developed both in LCF at different strain ranges and also ahead of fatigue cracks at different stress intensity ranges. Fractography was carried out to study the micromechanisms of crack propagation using a two stage replication technique. The experimental results were in good agreement with a theoretical model for FCP developed previously by the authors which incorporates mechanical and microstructural variables.     

A new version of AAKF (Reduced Tensor Matrix Elements) adapted to spectroscopic notation

Title of program: REDUCED TENSOR MATRIX ELEMENTS 2 Catalogue number: AAKP Program obtainable from: CPC Program Library, Queen's University of Belfast N. Ireland (see application form in this issue) Computer: Installation: IBM 360/75 University of Waterloo, Waterloo, Ont. Canada Operating system: OS/360 HASP II Programming languages used: FORTRAN IV High speed store required: 102 K bytes No. of bits per byte: 8 Overlay structure: None Other peripherals used: Card reader, line printer No. of cards in combined program and test deck: 1524 Card punching code: EBCDIC 029CPC Library subprograms used:

     

36.

Optical properties of CdS sintered film     

D. Patidar  R. Sharma  N. Jain  T. P. Sharma  N. S. Saxena 《Bulletin of Materials Science》2006,29(1):21-24

Chemical method has been used to prepare cadmium sulphide by using cadmium, hydrochloric acid and H₂S. The reflection spectra of covered and uncovered sintered films of CdS have been recorded by ‘Hitachi spectrophotometer’ over the wavelength range 300–700 nm. The energy band gaps of these films have been calculated from reflection spectra. It is found that the energy band gap of both films is same as 2.41 eV. It is indicated that energy band gap of these films does not change. This value of band gap is in good agreement with the value reported by other workers. The measurement of photocurrent has also been carried out using Keithley High Resistance meter/ Electrometer. This film shows the high photosensitivity and high photocurrent decay. Thus so obtained films are suitable for fabrication of photo detectors and solar cells.     

37.

Flank milling with flat end milling cutters     

Sanjeev Bedi Author Vitae  Cornelia Menzel ^{Author Vitae} 《Computer aided design》2003,35(3):293-300

One situation encountered in industry is that two curves on the machined surface are known, such as the top and bottom profiles of a blade. The shape of the surface is not known and is to be determined by a tool sliding along the generating rails. In this paper, we give a detailed mathematical understanding of flank milling with flat end cutters, which we then use to develop a method for milling with such a cutter. This method slides the cutter along two rails, keeping the cutter tangent to both curves at every parameter value. Examples are given to illustrate the method, along with simulations and error analysis.     

38.

SEU reliability improvement due to source-side charge collection in the deep-submicron SRAM cell     

Saxena  P.K. Bhat  N. 《Device and Materials Reliability, IEEE Transactions on》2003,3(1):14-17

The effect of technology scaling (0.5-0.09 /spl mu/m) on single event upset (SEU) phenomena is investigated using full two-dimensional device simulation. The SEU reliability parameters, such as critical charge (Q/sub crit/), feedback time (T/sub fd/) and linear energy transfer (LET), are estimated. For L/sub g/<0.18 /spl mu/m, the source node collects a significant fraction of radiation-induced charge resulting in an increase of LET, despite the lower critical charge at the sensitive drain node. The effect of striking location on LET confirms this finding.     

39.

Smart Messages: A Distributed Computing Platform for Networks of Embedded Systems     

Kang  Porlin; Borcea  Cristian; Xu  Gang; Saxena  Akhilesh; Kremer  Ulrich; Iftode  Liviu 《Computer Journal》2004,47(4):475-494

     

40.

Design, implementation, and evaluation of differentiated caching services   总被引：3，自引：0，他引：3  

Lu  Y. Abdelzaher  T.F. Avneesh Saxena 《Parallel and Distributed Systems, IEEE Transactions on》2004,15(5):440-452

With the dramatic explosion of online information, the Internet is undergoing a transition from a data communication infrastructure to a global information utility. PDAs, wireless phones, Web-enabled vehicles, modem PCs, and high-end workstations can be viewed as appliances that "plug-in" to this utility for information. The increasing diversity of such appliances calls for an architecture for performance differentiation of information access. The key performance accelerator on the Internet is the caching and content distribution infrastructure. While many research efforts addressed performance differentiation in the network and on Web servers, providing multiple levels of service in the caching system has received much less attention. It has two main contributions. First, we describe, implement, and evaluate an architecture for differentiated content caching services as a key element of the Internet content distribution architecture. Second, we describe a control-theoretical approach that lays well-understood theoretical foundations for resource management to achieve performance differentiation in proxy caches. An experimental study using the Squid proxy cache shows that differentiated caching services provide significantly better performance to the premium content classes.     

[首页] « 上一页 [1] [2] [3] 4 [5] [6] [7] [8] [9] [10] [11] 下一页 » 末  页»

Cat. numbers	Titles	Refs. in C.P.C.
ACQB	P SHELL CFP	1 (1969) 15
ACRN	A NEW D SHELL CFP	6 (1973) 88
AAGD	NJSYM	1 (1970) 241, 2 (1971) 173
AAGD0001	ADAPT NJSYM FOR WEIGHTS		2 (1971) 180
AAGD0002		ADAPT TO INTEGER ARITHMETIC	5 (1973) 161

Optical properties of CdS sintered film

Chemical method has been used to prepare cadmium sulphide by using cadmium, hydrochloric acid and H₂S. The reflection spectra of covered and uncovered sintered films of CdS have been recorded by ‘Hitachi spectrophotometer’ over the wavelength range 300–700 nm. The energy band gaps of these films have been calculated from reflection spectra. It is found that the energy band gap of both films is same as 2.41 eV. It is indicated that energy band gap of these films does not change. This value of band gap is in good agreement with the value reported by other workers. The measurement of photocurrent has also been carried out using Keithley High Resistance meter/ Electrometer. This film shows the high photosensitivity and high photocurrent decay. Thus so obtained films are suitable for fabrication of photo detectors and solar cells.     

Flank milling with flat end milling cutters

One situation encountered in industry is that two curves on the machined surface are known, such as the top and bottom profiles of a blade. The shape of the surface is not known and is to be determined by a tool sliding along the generating rails. In this paper, we give a detailed mathematical understanding of flank milling with flat end cutters, which we then use to develop a method for milling with such a cutter. This method slides the cutter along two rails, keeping the cutter tangent to both curves at every parameter value. Examples are given to illustrate the method, along with simulations and error analysis.     

SEU reliability improvement due to source-side charge collection in the deep-submicron SRAM cell

The effect of technology scaling (0.5-0.09 /spl mu/m) on single event upset (SEU) phenomena is investigated using full two-dimensional device simulation. The SEU reliability parameters, such as critical charge (Q/sub crit/), feedback time (T/sub fd/) and linear energy transfer (LET), are estimated. For L/sub g/<0.18 /spl mu/m, the source node collects a significant fraction of radiation-induced charge resulting in an increase of LET, despite the lower critical charge at the sensitive drain node. The effect of striking location on LET confirms this finding.     

Design, implementation, and evaluation of differentiated caching services

With the dramatic explosion of online information, the Internet is undergoing a transition from a data communication infrastructure to a global information utility. PDAs, wireless phones, Web-enabled vehicles, modem PCs, and high-end workstations can be viewed as appliances that "plug-in" to this utility for information. The increasing diversity of such appliances calls for an architecture for performance differentiation of information access. The key performance accelerator on the Internet is the caching and content distribution infrastructure. While many research efforts addressed performance differentiation in the network and on Web servers, providing multiple levels of service in the caching system has received much less attention. It has two main contributions. First, we describe, implement, and evaluate an architecture for differentiated content caching services as a key element of the Internet content distribution architecture. Second, we describe a control-theoretical approach that lays well-understood theoretical foundations for resource management to achieve performance differentiation in proxy caches. An experimental study using the Squid proxy cache shows that differentiated caching services provide significantly better performance to the premium content classes.