Spelling suggestions: "subject:"[een] CLUSTER"" "subject:"[enn] CLUSTER""
71 |
Capacity handling : a necessity in Linux clustersLyshaugen, Thomas January 2006 (has links)
No description available.
|
72 |
Competitive Advantage Research of Foundry Industry Cluster¡X A Case of T CompanyWang, Chi 20 August 2010 (has links)
Abstract
The foundry is a new concept of IC industry. ITRI (Industrial Technology Research Institute ) make the concept from a lab into a real company. It encourages many people engaged into this field. The foundry industry has become the famous logo of Taiwan¡¦s manufacturing capabilities in the world.
The foundry industry made a whole new way to develop a Hi-Tech manufacturing and efficient management company in Taiwan. We could combine well all resource in this field, for example, human resource, knowledge resource, technology resource and financial resource. We are so proud of the IC capabilities and strength we got after developing years. There are no any one company to overthrow our leading position.
So T company is my interesting about this topic to research it. From the leading position of foundry field to the biggest IC manufacturing company, Taiwan and TSMC are key roles of the IC stage. The research has two purposes.
1. Realize the importance of an enterprise success though a ¡§cluster¡¨ concept.
And an enterprise could promote its economies of scale and enhance its own core competence in cluster conditions.
2. Explain industrial cluster for an enterprise development and competitive strategy application.
Key words : Foundry, Cluster, Competitive Advantage
|
73 |
Architectural support for enhancing security in clustersLee, Man Hee 15 May 2009 (has links)
Cluster computing has emerged as a common approach for providing more comput-
ing and data resources in industry as well as in academia. However, since cluster
computer developers have paid more attention to performance and cost e±ciency
than to security, numerous security loopholes in cluster servers come to the forefront.
Clusters usually rely on ¯rewalls for their security, but the ¯rewalls cannot prevent
all security attacks; therefore, cluster systems should be designed to be robust to
security attacks intrinsically.
In this research, we propose architectural supports for enhancing security of clus-
ter systems with marginal performance overhead. This research proceeds in a bottom-
up fashion starting from enforcing each cluster component's security to building an
integrated secure cluster. First, we propose secure cluster interconnects providing con-
¯dentiality, authentication, and availability. Second, a security accelerating network
interface card architecture is proposed to enable low performance overhead encryption
and authentication. Third, to enhance security in an individual cluster node, we pro-
pose a secure design for shared-memory multiprocessors (SMP) architecture, which
is deployed in many clusters. The secure SMP architecture will provide con¯dential
communication between processors. This will remove the vulnerability of eavesdrop-
ping attacks in a cluster node. Finally, to put all proposed schemes together, we
propose a security/performance trade-o® model which can precisely predict performance of an integrated secure cluster.
|
74 |
Synthesis, structure and magnetic properties of lanthanide cluster compoundsSweet, Lucas Edward 15 May 2009 (has links)
This dissertation focuses on the exploratory synthesis of compounds that contain
R6ZI12 (R= Ce, Gd, Er; Z=Mn, Fe, Co, C2) clusters with the goal of finding magnetically
interesting compounds. Several new compounds were made via high temperature, solid
state methods and structurally characterized using x-ray diffraction. Compounds that
contain isolated clusters were studied in order to understand the magnetic coupling
between lanthanide atoms.
The exploration of transition metal centered clusters resulted in the discovery of
two new structure types, CsR(R6CoI12)2 (R=Gd and Er) and (CeI)0.26(Ce6MnI9)2. The xray
crystal structure of CsEr(Er6CoI12)2 was solved in the Pa3 – space group with the cell
length 18.063(2) Å at 250K (Z = 4, R1 [I>2σ(I)] = 0.0459). (CeI)0.26(Ce6MnI9)2 was
made by combining KI, CeI3, MnI2 and Ce metal and heating to 850°C for 500 hrs. The
single crystal x-ray structure for (CeI)0.26(Ce6MnI9)2 was solved in the trigonal, P3 – space
group with lattice parameters of a = 11.695(1) Å c = 10.8591(2) Å (Z = 2, R1 [I>2σ(I)] =
0.0895).
The magnetic susceptibilities of hexanuclear gadolinium clusters in the
compounds Gd(Gd6ZI12) (Z = Co, Fe or Mn), CaxGd1-x(Gd6MnI12) and CsGd(Gd6CoI12)2
are reported. The single-crystal structure of Gd(Gd6CoI12) and CaxGd1-x(Gd6MnI12) are
reported here as well. The compound with a closed shell of cluster bonding electrons, Gd(Gd6CoI12), exhibits the effects of antiferromagnetic coupling over the entire range of
temperatures measured (4 - 300 K). Clusters with unpaired, delocalized cluster bonding
electrons (CBEs) exhibit enhanced susceptibilities consistent with strong ferromagnetic
coupling, except at lower temperatures (less than 30 K) where intercluster
antiferromagnetic coupling suppresses the susceptibilities.
Four new compounds containing Gd6C2 clusters have been found: Gd6C2I11,
Gd(Gd6C2I12), CsGd(Gd6C2I12)2 and Cs(Gd6C2I12). Gd6C2I11 and Cs(Gd6C2I12)
crystallized in the P1 space group while Gd(Gd6C2I12) and CsGd(Gd6C2I12)2 crystallized
in the R3 and Pa3 space groups respectively. The magnetic susceptibility data for
Cs(Gd6C2I12) indicate strong intracluster ferromagnetic coupling, but antiferromagnetic
coupling suppresses the susceptibility below 150 K. DFT calculations on CsGd6C2I12
and molecular models indicate that the magnetic coupling between the basal Gd atoms is
stronger than the magnetic coupling involving the axial Gd atoms in the distorted
clusters.
|
75 |
Detecting Tangled Logic Structures in VLSI NetlistsJindal, Tanuj 2010 August 1900 (has links)
This thesis proposes a new problem of identifying large and tangled logic structures in a
synthesized netlist. Large groups of cells that are highly interconnected to each other can
often create potential routing hotspots that require special placement constraints. They can
also indicate problematic clumps of logic that either require resynthesis to reduce wiring
demand or specialized datapath placement. At a glance, this formulation appears similar
to conventional circuit clustering, but there are two important distinctions. First, we are
interested in finding large groups of cells that represent entire logic structures like adders
and decoders, as opposed to clusters with only a handful of cells. Second, we seek to pull
out only the structures of interest, instead of assigning every cell to a cluster to reduce
problem complexity. This work proposes new metrics for detecting structures based on
Rent’s rule that, unlike traditional cluster metrics, are able to fairly differentiate between
large and small groups of cells. Next, we demonstrate how these metrics can be applied to
identify structures in a netlist. Finally, our experiments demonstrate the ability to predict
and alleviate routing hotspots on a real industry design using our metrics and method.
|
76 |
Singles purchasing behavior in bride cake marketLiu, Jui-chin 15 June 2004 (has links)
The purpose of this study is to analyze consumer behavior in bride cake market. The study divides into two parts: one aims consumers who married before 1996 and are above 40-year-old. Through deep interviewing, we can profile consumer behavior in the bribe cake before 1996. The sample of the second study is singles of 18 to 35 years old. According to decision process of EKB model, this research tries to realize consumer purchasing behavior.
The results of this research are as follows:
1. The scale of bride cake industry won¡¦t diminish at the present time.
2. Acceptable price is rising up.
3. Western bride cake is consumer¡¦s favorite, then goes to the mixed form.
4. Famous bride cake chain store is the most favorite buying place.
5. Credit is the favorite payment pattern.
6. Valuable information comes from relatives, friends, and store¡¦s sales.
7. In terms of product attributes, consumer emphasizes ¡§good taste¡¨, ¡§good services¡¨, and ¡§fair price¡¨.
8. Geographical variables don¡¦t have significant differences in consumer behavior.
9. Via cluster analysis, samples are divided into three groups, namely ¡§Fashion Seeker¡¨, ¡§Innovator and Adventurer¡¨, and ¡§Realist and economist¡¨. In terms of demographic variables, significant differences exist only in sex and age. There are more female in ¡§Fashion Seeker¡¨ and ¡§Realist and economist¡¨. And the age in these two groups is for the most part range from 18 to 25 years old. The age of ¡§Innovator and Adventurer¡¨ is for the most part range from 26 to 30 years old. ¡§Fashion Seeker¡¨ values ¡§vogue¡¨, ¡§beautiful looking¡¨ and ¡§notable brand¡¨, and concerned ¡§TV advertisement¡¨.
|
77 |
Improvement of Load-balance of the LVS Web ClusterTung, Kuang-Yuan 28 June 2004 (has links)
We use load balance technique, Linux Virtual Server. Cluster server system construct the efficient structure own high scalability and availability through connecting with high performance network or LAN.
In addition, applications provide transmitting real-time video and audio are increasingly needed with network bandwidth increase. To fit the current trend and test the multimedia streaming support of LVS, we add streaming service into web cluster system.
But the playing of stream is not smooth, when the system is running. Streaming have serious delay and so we propose transmitting stream directly. When user had chose stream media from web then the client connect with streaming server directly and play the media continually, so we improve the performance of streaming.
|
78 |
Content-Based Differentiated Resource Management on Web ClusterYuang, Chia-Sun 29 August 2001 (has links)
In this thesis we propose a Content-Based Differentiated Resource Management Mechanism for web cluster. The major difference of our system from other researches is that we used the URL string of content for request routing and admission control.
In the system we implemented two important mechanisms for resource management. The Content-Based Load Balancing is used to share the service requests of each server node and the admission control avoids overload and provides differentiated web service for high priority content. We separate the content into Static Content and Dynamic Content. For Static content, we consider the influence of I/O resource and for dynamic content we consider the influence of CPU resource. When system running server nodes send their load information to distributor periodically, and distributor sorts these server nodes according their load. The I/O load of server is its network bandwidth usage and CPU load information is its CPU Utilization. In the period that the system updates the load information, requests are be forwarded to Light Load Set. CPU light load set are the servers, which have lower CPU Utilization, and I/O light load set are servers having lower network bandwidth usage. And we use load index of each request recorded in URL table and bucket of each node to distribute the traffic evenly. When overload, admission control drops the lower priority request to protect the high priority requests. With priority and differentiated service, our system can provide more resource to important content.
Experiment results show that the proposed system has better performance than Linux Virtual Server(LVS) with Laver4 routing mechanism including RR(Round Robin) and WLC(Weight Least Connection).
|
79 |
Design and Implementation of the Mobile Administration System for Distributed Web ServerShu, Ming-Jen 26 July 2002 (has links)
Recently, the explosive growth of the World Wide Web (WWW for short) has raised great. The performance, scalability and availability of web system is importance. So, large-scale web sites use cluster architecture at now. Although web cluster architecture provides those advantages of performance, scalability and availability, and so on, but management is too trouble. As a result, efficient management and maintenance will be a primarily concern on the performance of such complex system. And we know that administrator is not always at office, maybe go out. If anything come up in the system, how to do? So, let administrator to do mobile administration at anytime, any time, and intelligent function sole system event quickly. Administration anywhere will come true.
In this paper, we design and implement the Mobile Administration System for Distributed Web Server to solve above problems. In the system, we illustrate mobile devices at now, for example, mobile phone, PDA, hand-held device, and so on. For the sake of let all mobile devices to use administration system, we design a gateway that using Model-View-Controller architecture. The gateway supports all data type, for example, WML, VHTML, XHTML, and so on. We also design the Push Function to tell administrator what happened in the system. Besides, Intelligent Function help administrator to handle system event quickly, the system will be more reliability.
Mobile Administration System for Distributed Web Server let administrator to do mobile administration at anytime, any time. Another, intelligent function sole system event quickly, so the system will be more reliability. The Mobile Administration System has below features¡G1.Support all mobile to manage. 2.Push Function tells administrator what happened in the system.
3.Intelligent Function handles system event quickly.
|
80 |
The Design and Implementation of Hardware-based Packet Forwarding Mechanism on Web ClusterLee, Chih-Feng 29 July 2002 (has links)
The Internet and web service have become the most popularly platform and application of the Client-Server model due to the universality of the network recently years. Its growth is too fast to imagine the effect, many traditional service changes into web service stage by stage, and the load of the servers become more and more heavy. In the situation the server architecture must be adapted oppositely. The web cluster architecture has the best suit of the scalability, reliability and high performance requirement, was used extensively. We have designed and implemented a mechanism termed Content-aware Distributor, which is a software module for kernel-level extension, to effectively support content-based routing.
This paper is based on the achievement of the software-based Content-aware Distributor; we deliver some high repetition and fixity tasks to the hardware module, instead of the software module, to expect the hardware module could share the load of the software module and speedup the packet processing.
We design and implement the hardware-based packet forwarding mechanism, by the analyze result from the software module; partition three major functions into three Engines: The Analyze Engine, which is responsible to identify and analyze the header of the packet, and decide the packet needs to be send to the upper layer or forwarded; The Lookup Engine, which is responsible to lookup the address of the table which stores the data of packet modification; and the Update Engine, used to modify the packet header as soon as possible then transfer to the send queue. We use an algorithm termed Patch to fast calculate the checksums; it causes the packet length independence modification.
For the implementation, we use the Verilog HDL and EDA tools of Altera Corporation to accomplish the whole design. Simulation and evaluation the performance of processing the minimum packets, by operation at 50MHz system clock; our mechanism is faster double times than the packet receiving of two Fast Ethernet ports. From the resule we know our hardware mechanism is not only sharing the load of the upper layer, but also speedup the packet forwarding.
|
Page generated in 0.0478 seconds