Zippy - A coarse-grained reconfigurable array with support for hardware virtualization
|
|
- Paul Byrd
- 5 years ago
- Views:
Transcription
1 Zippy - A oarse-grained reonfigurable array with support for hardware virtualization Christian Plessl Computer Engineering and Networks Lab ETH Zürih, Switzerland plessl@tik.ee.ethz.h Maro Platzner Department of Computer Siene University of Paderborn, Germany platzner@upb.de Abstrat This paper motivates the use of hardware virtualization on oarse-grained reonfigurable arhitetures. We introdue Zippy, a oarse-grained multi-ontext hybrid CPU with arhitetural support for effiient hardware virtualization. The arhitetural details and the orresponding tool flow are outlined. As a ase study, we ompare the nonvirtualized and the virtualized exeution of an ADPCM deoder. 1 Introdution and Related Work Coarse-grained reonfigurable arhitetures onsist of ALU-based ell arrays and bus-based interonnets. Coarse-grained devies exel in area and energy-effiieny for appliations that require many arithmeti and logial operations on byte and word-sized data. In the last years, many oarse-grained arhitetures have been proposed [14, 16, 12, 1]. Reonfigurable arhitetures arrange operations spatially, whereas proessors arrange operations (mainly) in time. While proessors an ompute arbitrarily large appliations, provided that suffiient memory exists, reonfigurable arhitetures run into a fundamental problem when an appliation exeeds the array size. Hardware virtualization denotes a set of tehniques that try to overome this limitation by utilizing the re-onfigurability of reonfigurable devies. Previously, we have lassified hardware virtualization approahes into three ategories [13]: Temporal partitioning, virtualized exeution, and virtual mahine: Temporal partitioning The first use of the term virtual hardware pointed to the analogy to virtual memory. In a virtual memory system, memory pages are swapped in and out of the main memory, giving appliations the illusion of a muh larger ress spae than physially existent. Similarly, reonfigurable omputing systems an allow appliations to use more hardware than physially existent by swapping in and out portions of the hardware using a reonfiguration proess. This onept leads to temporal partitioning, whih allows for mapping an appliation of arbitrary size to a reonfigurable devie with insuffiient hardware apaity. Temporal partitioning splits appliations into smaller parts, where eah part fits on the devie, and runs these parts sequentially. Related work in arhitetures for hardware virtualization inludes the timemultiplexed FPGA [15], the DPGA arhiteture [4], the Chameleon arhiteture [16] and the DRLE arhiteture [8]. Virtualized exeution Later, the term hardware virtualization was used in a slightly different way to desribe tools and arhitetures that allow for a ertain degree of independene between the synthesized appliation and the atual apaity of the reonfigurable devie. This approah stresses the analogy to instrution set proessors, where the definition of an instrution set deouples appliations from the atual hardware. Similarly, virtualized exeution strives for obtaining a ertain level of ompatibility within a reonfigurable devie family. This ompatibility is ahieved by the definition of a programming model and an atomi unit of omputation. Appliations are split into modules, where eah module fits onto the atomi operator. The programming model speifies the oordination and ommuniation between modules. A onrete instane of the exeution arhiteture an implement any number of atomi operators. The exeution order of the modules is determined either at run-time or at load-time. Examples for virtualized exeution arhitetures are PipeRenh [9], Sore [3], and WASMI [8]. We have also investigated virtualized exeution on the Zippy arhiteture [6, 7] in our previous work. Virtual mahine The virtual mahine approah tries to ahieve an even higher level of devie independene by following the onepts of virtual mahines 1
2 and portable ode. The appliation is speified for an abstrat exeution arhiteture and a hardware virtual mahine is responsible for remapping this speifiation for the abstrat arhiteture model to the onrete exeution arhiteture. Researh in hardware virtual mahines has been reported in [11, 10]. Although this approah seems intriguing sine it features platform independent hardware, no effiient implementation of a hardware virtual mahine has been shown so far. The Zippy projet aims at the investigation of a hybrid proessor onsisting of an embedded CPU and a oarsegrained reonfigurable array. Hardware virtualization is a entral aspet of the Zippy projet. Previously, we have desribed the Zippy arhiteture with its basi support tools featuring a system-level, yle-aurate simulation environment [7, 6, 5]. In ontrast, this paper fouses on the arhitetural features for hardware virtualization, espeially for the temporal partitioning approah. Up to now, work in temporal partitioning has onentrated on fine-grained arhitetures and netlists or data-flow graphs as appliation models. For oarse-grained arhitetures, temporal partitioning of netlists has been hardly treated so far. Most studies assume that appliations are speified in a high-level language and that only runtime intensive loops are mapped to the oarsegrained arhiteture. This leads to different problems, more related to parallelizing ompilation tehnology, e.g, loopunrolling, vetorization, modulo-sheduling. We argue that effiient hardware virtualization requires the simultaneous development of the arhiteture and the orresponding tool flow, rather than building virtualization tools on top of an existing or fully speified arhiteture. The Zippy framework with its parameterizable models and tools forms an ideal environment for suh an arhiteture-toolflow odesign. In Setion 2, the Zippy arhiteture and the orresponding tool flow is presented. Setion 3 disusses a ase study demonstrating the benefits of temporal partitioning. Finally, Setion 4 onludes the paper and points to further work. 2 The Zippy Arhiteture The Zippy arhiteture is not a single, onrete arhiteture but an arhitetural simulation model of a hybrid CPU. The model integrates an embedded CPU ore with a oarsegrained reonfigurable unit and an be widely parameterized to resemble whole families of hybrid CPUs. Zippy was reated to provide an experimentation framework for hybrid CPUs and, speifially, hardware virtualization. Zippy arhitetures are modeled at a level of detail that is suffiient for system-wide yle-aurate simulation. Besides the simulation tools, Zippy inludes a tool-hain to generate software and hardware exeutables. Along with our Reonfigurable Unit Coproessor Interfae Config. Memory Context Sequener FIFO FIFO Coarse Grained Reonfigurable Array Register Interfae Ctrl Addr Data Figure 1. Reonfigurable Unit Arhiteture previous work on virtualized exeution, the Zippy system arhiteture and the o-simulation framework has been presented in detail [7, 5, 6]. For our urrent work on temporal partitioning on oarse-grained arrays the Zippy arhiteture has been extended. Hene the following setion will onentrate on the hanges to the arhiteture in partiular to the reonfigurable ell that have been introdued to support temporal partitioning. Finally the supporting software tools are briefly disussed. 2.1 System and Reonfigurable Unit Arhiteture Zippy is omposed of two main units, the CPU ore and the reonfigurable unit (RU), attahed via a o-proessor port. The oproessor port is used for all data-transfers between the CPU and the RU and exposes all RU funtions to the CPU via read and write operations on the RU s register interfae. Figure 1 shows a shemati diagram of the reonfigurable unit. Zippy is a multi-ontext arhiteture, i.e., several onfigurations an be stored onurrently in the onfiguration memory. The RU an swith rapidly between these onfigurations. The ativation and sequening of onfigurations is ontrolled by the ontext sequener. The FIFOs are used to pass input data and results between the CPU ore and the reonfigurable array and also between different onfigurations (ontexts) of the RU. The register interfae provides aess to the RU funtion bloks to the CPU. The reonfigurable array is the workhorse of the Zippy arhiteture. The array is built of omputing ells, memory bloks, input and output ports and an interonnetion network. The interonnet splits into two substrutures, a bus interonnet and a loal interonnet struture. As with many parts of the Zippy arhiteture, the reonfigurable array is parameterized. Figure 2 shows the programmable bus interonnet of this 4x4 ell instane of the Zippy ar-
3 vbus_e 2.2 Reonfigurable Cell Arhiteture INP0 hbus_mem INP1 hbus_s hbus_n MEM0 MEM1 MEM2 MEM3 Figure 2. Reonfigurable Array: Bus Interonnet ray. Programmable routing swithes are indiated by small bus-driver symbols at the rossing of wires. There are three types of horizontal buses: the horizontal north buses (hbus n) that onnet ells in adjaent rows, the horizontal south buses (hbus s), that onnet ells in the same row, and the memory buses (hbus mem), that onnet all ells in a row to an on-hip memory blok. Additionally, the vertial east buses (vbus e) provide onnetivity between the ells in the same olumn. For the following disussion we onsider an array instane with 4x4 ells, 2 horizontal north and south buses, 2 vertial east buses and 2 input and 2 output ports. The bit-width of the ALUs and buses is onfigured to 24 bit. In ition to the bus interonnet the array provides also loal interonnet between neighboring ells. Eah ell an read the output data from all of its 8 immediate neighbors. The loal interonnet is also fully homogeneous thanks to ylial ontinuation at the edges of the array. The ells an read data from the FIFOs via the input buses (INP0/1) and they an write data to the FIFOs using the output buses (OUTP0/1). The ells an onnet to the input and output buses using the horizontal north buses. The ontrol signals for the FIFOs are generated by programmable ontrollers. OUTP0 OUTP1 Figure 3 presents a detailed view of the onfigurable ell. The ell has a rather versatile input struture with overall three inputs, an operator blok, and an output struture. Eah of the inputs an onnet to either of five soures: any loal neighbor, a horizontal bus, a vertial bus, a onstant, or to the ell s output register (feedbak path). The ell s onfiguration determines whih of these input soures or onstant values is atually seleted. The operator blok is ALU-based and performs the ell omputation. Figure 3 inludes a table of implemented ell operations. Most arithmeti and logial operations are selfexplaining. The pass operation passes the input value to the output (identity), what an be useful for routing purposes. The testbitat instrutions are used for bit-tests. testbitat0(value,mask) takes an input value and a mask and returns 1 if all bits that are set in mask are set to 0 in value, otherwise the operator returns 0. The testbitat1 operator works analogously for testing whether bits are set to 1. The (sel,a,b) operator forwards input a or input b to the output, depending on the value of the least-signifiant bit of sel. This operator is partiularly useful for implementing ontrol-flow, i.e., data-dependent proessing, on the reonfigurable array. Eah row of ells has aess to a shared ROM memory blok, f. Fig. 2. The rom(r) operation of a ell reads the ontents at ress r of the ROM assoiated with this ell. The ontents of the ROM are part of the onfiguration. Zippy is speifially designed to support hardware virtualization, in partiular through time-multiplexed exeution of iruits. To this end, the reonfigurable array arhiteture is designed as a multi-ontext arhiteture. A multiontext arhiteture an onurrently store several onfigurations on-hip. The ontext sequener whih is part of the RU an swith rapidly between these onfigurations and ativate one of the ontexts for exeution. All ontexts share the omputation elements in the data-path, but eah ontext has its own set of registers. This allows to store intermediate results generated by a ontext until the next ontext invoation and eliminates the need to use memory strutures to store these data and time-onsuming ontext store and restore phases. Moreover, the Zippy ell provides means for a ontext to read registers from other ontexts whih enables effiient data-transfers between ontexts. Figure 3 shows the integration of these per-ontext register files into the Zippy ell arhiteture. A reonfigurable ell features one input register file per input and an output register file. The ell inputs are always registered, independently of whether the data will later on be used or not. That is, when a ell reeives an input data in a given exeution yle, the data is written to the input register seleted by
4 hbus onst vbus hbusn hbusn txno... txno loal OP hbusn arithmeti ops:,sub,mul,neg logi ops: not,and,nand,or, nor,xor,xnor, srl,sll, ror,rol,pass test ops: eq,neq,lte,gte tstbitat0, memory ops: rom other ops: legend: determined by onfiguration determined by ative ontext txno Figure 3. Reonfigurable Unit: Cell Model the ontext seletor (txno). In the same yle, the input data for the operation blok is either a onstant, the diret ell input, or an be read from any of the input registers. This hoie is part of the onfiguration. The output of the operator blok is also automatially registered in the output register file ontrolled by the ontext seletor. In ontrast, the ell output is ontrolled by the onfiguration and an be seleted out of the diret operator output and any of the output registers. Generally, an appliation iruit ontains (ombinational) operators and registers. We all these registers user registers. A virtualized iruit requires itionally soalled virtualization registers that are used to transfer data between ontexts. While the registers in the register-rih Zippy ell an be used arbitrarily, we have deided to implement user registers in the ells input register files and the virtualization registers in the ells output register files. This speifi hoie has been made to simplify the proess of mapping virtualized appliations to the array. At the same time, this hoie imposes onstraints on the mapping and the ell usage. For example, an operation in ell x writes its result to the orresponding output register of that ell. An operator mapped to ell y in a subsequent ontext requiring this data as an input has to read from ell x. This leads to i) routing between the two ells and ii) the fat that the regular output of ell x annot be used in the subsequent onfiguration. The operation blok of ell x an, however, still be utilized. 2.3 Tool-flow and Simulation Environment The Zippy software support omprises a number of tools that allow a designer to generate appliations onsisting of parts running in software and parts running in hardware. The software tool flow inludes a C ompiler and a funtion library for aessing the reonfigurable hardware from the software appliation. The ompiler hain is based on SimpleSalar s versions of the GNU C ompiler and utilities and has been desribed in [5]. For mapping appliations onto the reonfigurable array, we have developed tools for tehnology-mapping, plaing and routing iruits onto the reonfigurable array. The appliations are given in graph form and are onverted to a textual desription in the Zippy Netlist Format (ZNF). Map, plae and route tools operate on this format. While these algorithms have been speifially tailored to the Zippy arhitetural model, they have been inspired by tehniques and algorithms known from FPGA plaement and routing [2]. After running the tools, the resulting plaed and routed netlist is passed to a onfiguration generator tool whih turns the array onfiguration into a format that an be read and loaded by the CPU during runtime. The performane evaluation of different Zippy arhitetures and virtualization tehniques is performed with our o-simulation framework whih has been disussed in [5, 7]. 3 Case Study The ase study illustrates the use of the Zippy arhiteture and in partiular its support for hardware virtualization. We ompare the exeution of an ADPCM appliation on a large instane of the Zippy arhiteture with a smaller instane of the same arhiteture. The large instane requires more area but allows to map the omplete appliation into one onfiguration. The smaller instane requires hardware virtualization to run the appliation. Both implementations are ompared to an implementation that uses only the CPU ore. 3.1 Appliation ADPCM is a well established speeh oding algorithm. Figure 4 presents our hardware implementation that has been manually derived from the C-ode referene implementation. ADPCM uses 31 ombinational operators (that an be diretly implemented by a ell), 3 dediated registers, 1 input, and 1 output port. The dediated registers an be implemented within the input register files of the Zippy ells, f. Fig. 3. Thus the hardware implementation requires an exeution arhiteture with at least 31 ells.
5 in t_120 t_230 t_231 t_232 op0 rom indextbl op2 gt : i1=88 index op1 op4a : i0=88 : i1=d op4 op19 rom stepsztbl op3 lt : i1=0 op4b : i1=0 op10 srl : i1=2 op11 srl : i1=1 ontext 0 ontext 1 step op15 op13 op12 srl : i1=3 op14 op16 op7 : i1=4 op6 and : i1=7 op8 : i1= op9 op17 : i1=1 obuf pass0 valpred ontext 2 op20 op24 lt : i1= op18 op21 sub op22 op23 gt : i1=32767 op25a : i0= : i1=d op25 op5 : i1=8 op25b : i1=32768 out Figure 4. ADPCM: appliation netlist 3.2 Experiments For the non-virtualized implementation, we have hosen a reonfigurable array of size 7x7. Although a 6x6 array would provide a suffiient number of ells, the dense interonnet struture of the ADPCM netlist leads easily to ongestion and makes plaement and routing on a 6x6 array rather diffiult. Using a 7x7 array relaxes the implementation onstraints and allows the tools to quikly find a routable implementation. For the virtualized implementation the full netlist has been manually partitioned into three smaller netlists, suh that eah of them fits onto an array of size 4x4. An automati partitioning has not been implemented at the urrent stage of the projet. Figure 4 presents the division of the initial netlist into three ontexts. Virtualization registers have been inserted where data has to be transferred from one ontext to another. These virtualization registers are denoted by t x y in this figure. For eah of these netlists, a onfiguration is generated using the Zippy plae and route tools. Figure 4 shows that for this implementation all feedbak paths of the iruit stay within single ontexts. It must be noted that this is not a requirement for hardware virtualization. Due to the virtualization registers, feedbak yles between ontexts are possible. The pure software implementation uses the C soure ode of the ADPCM referene implementation. The ode has been ompiled with SimpleSalar s GNU C ompiler, with optimizations turned on and set to -O. 3.3 Experimental Setup and Results The performane results for the pure CPU implementation have been obtained by simulation with SimpleSalar. SimpleSalar s onfiguration parameters have been hosen to math a typial embedded CPU ore with in-order exeution and stati branh-predition, f. [5]. Table 1 summarizes the results of the ase study and demonstrates the trade-off involved in hardware virtualization. The superior performane of the single-ontext, nonvirtualized implementation is paid for with more than 3 times the hardware effort of the virtualized, 3-ontext, implementation. Thus, hardware virtualization seems useful in two situations: First, it offers a sensible approah to redue the amount of required hardware while still making use of omputation in spae. Seond, when the given hardware is too small to aommodate the overall iruit, hardware virtualization is mandatory. The results for the pure software implementation have been determined by measuring the number of yles needed for deoding 512 bloks of 1024 samples. The non-virtualized implementation deodes 1 sample per yle. The virtualized implementation requires 3 yles for deoding one ADPCM sample. Eah of the three on-
6 Implemen- yles relative array tation per sample speedup size CPU only n. a. single ontext ells 3-ontext ells Table 1. Performane of the three different ADPCM implementations texts is ativated and exeuted for one yle. This shedule is repeated ylially. The maximal lok frequeny for the reonfigurable array is appliation-speifi and would have to be determined by analyzing the longest path of the mapped and routed iruit. The timing model we urrently use is quite inaurate and does not onsider mapping and routing. However, we envision an embedded CPU ore that runs at modest lok frequenies. This justifies the assumption that both CPU ore and reonfigurable unit run at the same lok rate. 4 Conlusions and Future Work We have presented the Zippy hybrid CPU that employs a oarse-grained multi-ontext reonfigurable array. A distintive feature of Zippy is its support for hardware virtualization. While one approah of hardware virtualization, namely virtualized exeution, has already been presented in [5], this paper foused on an approah termed temporal partitioning. The Zippy arhiteture and the simulation environment allow us to perform studies with hardware virtualization tehniques. This is of utmost importane, sine no ommerial implementations of suh arhitetures are readily available. By a ase study we have demonstrated the feasibility of hardware virtualization and the involved trade-offs between exeution time and required hardware. Future work will fous on the development of algorithms that automatially perform the temporal partitioning of appliations onto the Zippy arhiteture. Our long term goal is to reate an end-to-end tool-flow that starts with a hardware desription (in the ZNF netlist format) and reates an implementation that uses hardware virtualization if needed. Referenes [1] V. Baumgartne, F. May, A. Nükel, M. Vorbah, and M. Weinhardt. PACT XPP a self-reonfigurable data proessing arhiteture. In Pro. 1st Int. Conf. on Engineering of Reonfigurable Systems and Algorithms (ERSA), pages 64 70, [2] V. Betz, J. Rose, and A. Marquardt. Arhiteture and CAD for Deep-Submiron FPGAs. Kluwer Aademi Publishers, [3] E. Caspi, M. Chu, R. Huang, J. Yeh, J. Wawrzynek, and A. DeHon. Stream omputations organized for reonfigurable exeution (SCORE). In Pro. 10th Int. Conf. on Field Programmable Logi and Appliations (FPL), pages , [4] A. DeHon. DPGA utilization and appliation. In Pro. 4th ACM Int. Symp. on Field-Programmable Gate Arrays (FPGA), pages , [5] R. Enzler, C. Plessl, and M. Platzner. Co-simulation of a hybrid multi-ontext arhiteture. In Pro. 3rd Int. Conf. on Engineering of Reonfigurable Systems and Algorithms (ERSA), pages CSREA Press, [6] R. Enzler, C. Plessl, and M. Platzner. Virtualizing hardware with multi-ontext reonfigurable arrays. In Pro. 13th Int. Conf. on Field Programmable Logi and Appliations (FPL), pages , [7] R. Enzler, C. Plessl, and M. Platzner. System-level performane evaluation of reonfigurable proessors. Miroproessors and Mirosystems, 29(issues 2 3):63 73, Apr [8] T. Fujii, K.-i. Furuta, M. Motomura, M. Nomura, M. Mizuno, K.-i. Anjo, K. Wakabayashi, Y. Hirota, Y.-e. Nakazawa, H. Itoh, and M. Yamashina. A dynamially reonfigurable logi engine with a multi-ontext/multi-mode unified-ell arhiteture. In 46th IEEE Int. Solid-State Ciruits Conf. (ISSCC), Dig. Teh. Papers, pages , [9] S. C. Goldstein, H. Shmit, M. Budiu, S. Cadambi, M. Moe, and R. R. Taylor. PipeRenh: A reonfigurable arhiteture and ompiler. IEEE Computer, 33(4):70 77, Apr [10] Y. Ha, P. Shaumont, M. Engels, S. Vernalde, F. Potargent, L. Rijnders, and H. D. Man. A hardware virtual mahine for the networked reonfiguration. In IEEE International Workshop on Rapid System Prototyping, pages , [11] Y. Ha, S. Vernalde, P. Shaumont, M. Engels, R. Lauwereins, and H. De Man. Building a Virtual Framework for Networked Reonfigurable Hardware and Software Objets. Journal of Superomputing, 21(2): , February [12] T. Miyamori and K. Olukotun. REMARC: Reonfigurable multimedia array oproessor. IEICE Trans. on Information and Systems, E82-D(2): , Feb [13] C. Plessl and M. Platzner. Virtualization of hardware introdution and survey. In Pro. 4rd Int. Conf. on Engineering of Reonfigurable Systems and Algorithms (ERSA), pages CSREA Press, [14] H. Singh, M.-H. Lee, G. Lu, F. J. Kurdahi, N. Bagherzadeh, and E. M. Chaves Filho. MorphoSys: An integrated reonfigurable system for data-parallel and omputation-intensive appliations. IEEE Trans. on Computers, 49(5): , May [15] S. Trimberger, D. Carberry, A. Johnson, and J. Wong. A time-multiplexed FPGA. In Pro. 5th IEEE Symp. on Field- Programmable Custom Computing Mahines (FCCM), pages 22 28, [16] Xinan Tang, M. Aalsma, and R. Jou. A ompiler direted approah to hiding onfiguration lateny in Chameleon proessors. In Pro. 10th Int. Conf. on Field Programmable Logi and Appliations (FPL), pages 29 38, 2000.
Pipelined Multipliers for Reconfigurable Hardware
Pipelined Multipliers for Reonfigurable Hardware Mithell J. Myjak and José G. Delgado-Frias Shool of Eletrial Engineering and Computer Siene, Washington State University Pullman, WA 99164-2752 USA {mmyjak,
More informationOn - Line Path Delay Fault Testing of Omega MINs M. Bellos 1, E. Kalligeros 1, D. Nikolos 1,2 & H. T. Vergos 1,2
On - Line Path Delay Fault Testing of Omega MINs M. Bellos, E. Kalligeros, D. Nikolos,2 & H. T. Vergos,2 Dept. of Computer Engineering and Informatis 2 Computer Tehnology Institute University of Patras,
More informationPartial Character Decoding for Improved Regular Expression Matching in FPGAs
Partial Charater Deoding for Improved Regular Expression Mathing in FPGAs Peter Sutton Shool of Information Tehnology and Eletrial Engineering The University of Queensland Brisbane, Queensland, 4072, Australia
More informationThe AMDREL Project in Retrospective
The AMDREL Projet in Retrospetive K. Siozios 1, G. Koutroumpezis 1, K. Tatas 1, N. Vassiliadis 2, V. Kalenteridis 2, H. Pournara 2, I. Pappas 2, D. Soudris 1, S. Nikolaidis 2, S. Siskos 2, and A. Thanailakis
More informationSystem-Level Parallelism and Throughput Optimization in Designing Reconfigurable Computing Applications
System-Level Parallelism and hroughput Optimization in Designing Reonfigurable Computing Appliations Esam El-Araby 1, Mohamed aher 1, Kris Gaj 2, arek El-Ghazawi 1, David Caliga 3, and Nikitas Alexandridis
More informationExtracting Partition Statistics from Semistructured Data
Extrating Partition Statistis from Semistrutured Data John N. Wilson Rihard Gourlay Robert Japp Mathias Neumüller Department of Computer and Information Sienes University of Strathlyde, Glasgow, UK {jnw,rsg,rpj,mathias}@is.strath.a.uk
More informationThis fact makes it difficult to evaluate the cost function to be minimized
RSOURC LLOCTION N SSINMNT In the resoure alloation step the amount of resoures required to exeute the different types of proesses is determined. We will refer to the time interval during whih a proess
More informationCOSSIM An Integrated Solution to Address the Simulator Gap for Parallel Heterogeneous Systems
COSSIM An Integrated Solution to Address the Simulator Gap for Parallel Heterogeneous Systems Andreas Brokalakis Synelixis Solutions Ltd, Greee brokalakis@synelixis.om Nikolaos Tampouratzis Teleommuniation
More informationAutomatic Physical Design Tuning: Workload as a Sequence Sanjay Agrawal Microsoft Research One Microsoft Way Redmond, WA, USA +1-(425)
Automati Physial Design Tuning: Workload as a Sequene Sanjay Agrawal Mirosoft Researh One Mirosoft Way Redmond, WA, USA +1-(425) 75-357 sagrawal@mirosoft.om Eri Chu * Computer Sienes Department University
More informationWhat are Cycle-Stealing Systems Good For? A Detailed Performance Model Case Study
What are Cyle-Stealing Systems Good For? A Detailed Performane Model Case Study Wayne Kelly and Jiro Sumitomo Queensland University of Tehnology, Australia {w.kelly, j.sumitomo}@qut.edu.au Abstrat The
More informationHEXA: Compact Data Structures for Faster Packet Processing
Washington University in St. Louis Washington University Open Sholarship All Computer Siene and Engineering Researh Computer Siene and Engineering Report Number: 27-26 27 HEXA: Compat Data Strutures for
More informationLearning Convention Propagation in BeerAdvocate Reviews from a etwork Perspective. Abstract
CS 9 Projet Final Report: Learning Convention Propagation in BeerAdvoate Reviews from a etwork Perspetive Abstrat We look at the way onventions propagate between reviews on the BeerAdvoate dataset, and
More informationMulti-Channel Wireless Networks: Capacity and Protocols
Multi-Channel Wireless Networks: Capaity and Protools Tehnial Report April 2005 Pradeep Kyasanur Dept. of Computer Siene, and Coordinated Siene Laboratory, University of Illinois at Urbana-Champaign Email:
More informationA Novel Validity Index for Determination of the Optimal Number of Clusters
IEICE TRANS. INF. & SYST., VOL.E84 D, NO.2 FEBRUARY 2001 281 LETTER A Novel Validity Index for Determination of the Optimal Number of Clusters Do-Jong KIM, Yong-Woon PARK, and Dong-Jo PARK, Nonmembers
More informationOutline: Software Design
Outline: Software Design. Goals History of software design ideas Design priniples Design methods Life belt or leg iron? (Budgen) Copyright Nany Leveson, Sept. 1999 A Little History... At first, struggling
More informationAnalysis of input and output configurations for use in four-valued CCD programmable logic arrays
nalysis of input and output onfigurations for use in four-valued D programmable logi arrays J.T. utler H.G. Kerkhoff ndexing terms: Logi, iruit theory and design, harge-oupled devies bstrat: s in binary,
More informationAutomatic Generation of Transaction-Level Models for Rapid Design Space Exploration
Automati Generation of Transation-Level Models for Rapid Design Spae Exploration Dongwan Shin, Andreas Gerstlauer, Junyu Peng, Rainer Dömer and Daniel D. Gajski Center for Embedded Computer Systems University
More informationAnnouncements. Lecture Caching Issues for Multi-core Processors. Shared Vs. Private Caches for Small-scale Multi-core
Announements Your fous should be on the lass projet now Leture 17: Cahing Issues for Multi-ore Proessors This week: status update and meeting A short presentation on: projet desription (problem, importane,
More informationExploring the Commonality in Feature Modeling Notations
Exploring the Commonality in Feature Modeling Notations Miloslav ŠÍPKA Slovak University of Tehnology Faulty of Informatis and Information Tehnologies Ilkovičova 3, 842 16 Bratislava, Slovakia miloslav.sipka@gmail.om
More informationA DYNAMIC ACCESS CONTROL WITH BINARY KEY-PAIR
Malaysian Journal of Computer Siene, Vol 10 No 1, June 1997, pp 36-41 A DYNAMIC ACCESS CONTROL WITH BINARY KEY-PAIR Md Rafiqul Islam, Harihodin Selamat and Mohd Noor Md Sap Faulty of Computer Siene and
More informationImproved Circuit-to-CNF Transformation for SAT-based ATPG
Improved Ciruit-to-CNF Transformation for SAT-based ATPG Daniel Tille 1 René Krenz-Bååth 2 Juergen Shloeffel 2 Rolf Drehsler 1 1 Institute of Computer Siene, University of Bremen, 28359 Bremen, Germany
More informationGray Codes for Reflectable Languages
Gray Codes for Refletable Languages Yue Li Joe Sawada Marh 8, 2008 Abstrat We lassify a type of language alled a refletable language. We then develop a generi algorithm that an be used to list all strings
More informationCross-layer Resource Allocation on Broadband Power Line Based on Novel QoS-priority Scheduling Function in MAC Layer
Communiations and Networ, 2013, 5, 69-73 http://dx.doi.org/10.4236/n.2013.53b2014 Published Online September 2013 (http://www.sirp.org/journal/n) Cross-layer Resoure Alloation on Broadband Power Line Based
More informationThe recursive decoupling method for solving tridiagonal linear systems
Loughborough University Institutional Repository The reursive deoupling method for solving tridiagonal linear systems This item was submitted to Loughborough University's Institutional Repository by the/an
More informationCOST PERFORMANCE ASPECTS OF CCD FAST AUXILIARY MEMORY
COST PERFORMANCE ASPECTS OF CCD FAST AUXILIARY MEMORY Dileep P, Bhondarkor Texas Instruments Inorporated Dallas, Texas ABSTRACT Charge oupled devies (CCD's) hove been mentioned as potential fast auxiliary
More informationHigh-level synthesis under I/O Timing and Memory constraints
Highlevel synthesis under I/O Timing and Memory onstraints Philippe Coussy, Gwenolé Corre, Pierre Bomel, Eri Senn, Eri Martin To ite this version: Philippe Coussy, Gwenolé Corre, Pierre Bomel, Eri Senn,
More informationAlgorithms, Mechanisms and Procedures for the Computer-aided Project Generation System
Algorithms, Mehanisms and Proedures for the Computer-aided Projet Generation System Anton O. Butko 1*, Aleksandr P. Briukhovetskii 2, Dmitry E. Grigoriev 2# and Konstantin S. Kalashnikov 3 1 Department
More informationThe Minimum Redundancy Maximum Relevance Approach to Building Sparse Support Vector Machines
The Minimum Redundany Maximum Relevane Approah to Building Sparse Support Vetor Mahines Xiaoxing Yang, Ke Tang, and Xin Yao, Nature Inspired Computation and Appliations Laboratory (NICAL), Shool of Computer
More informationRAC 2 E: Novel Rendezvous Protocol for Asynchronous Cognitive Radios in Cooperative Environments
21st Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communiations 1 RAC 2 E: Novel Rendezvous Protool for Asynhronous Cognitive Radios in Cooperative Environments Valentina Pavlovska,
More informationPerformance of Histogram-Based Skin Colour Segmentation for Arms Detection in Human Motion Analysis Application
World Aademy of Siene, Engineering and Tehnology 8 009 Performane of Histogram-Based Skin Colour Segmentation for Arms Detetion in Human Motion Analysis Appliation Rosalyn R. Porle, Ali Chekima, Farrah
More informationWe don t need no generation - a practical approach to sliding window RLNC
We don t need no generation - a pratial approah to sliding window RLNC Simon Wunderlih, Frank Gabriel, Sreekrishna Pandi, Frank H.P. Fitzek Deutshe Telekom Chair of Communiation Networks, TU Dresden, Dresden,
More informationA Load-Balanced Clustering Protocol for Hierarchical Wireless Sensor Networks
International Journal of Advanes in Computer Networks and Its Seurity IJCNS A Load-Balaned Clustering Protool for Hierarhial Wireless Sensor Networks Mehdi Tarhani, Yousef S. Kavian, Saman Siavoshi, Ali
More informationVerifying Interaction Protocol Compliance of Service Orchestrations
Verifying Interation Protool Compliane of Servie Orhestrations Andreas Shroeder and Philip Mayer Ludwig-Maximilians-Universität Münhen, Germany {shroeda, mayer}@pst.ifi.lmu.de Abstrat. An important aspet
More informationMethods for Multi-Dimensional Robustness Optimization in Complex Embedded Systems
Methods for Multi-Dimensional Robustness Optimization in Complex Embedded Systems Arne Hamann, Razvan Rau, Rolf Ernst Institute of Computer and Communiation Network Engineering Tehnial University of Braunshweig,
More informationParametric Abstract Domains for Shape Analysis
Parametri Abstrat Domains for Shape Analysis Xavier RIVAL (INRIA & Éole Normale Supérieure) Joint work with Bor-Yuh Evan CHANG (University of Maryland U University of Colorado) and George NECULA (University
More informationSVC-DASH-M: Scalable Video Coding Dynamic Adaptive Streaming Over HTTP Using Multiple Connections
SVC-DASH-M: Salable Video Coding Dynami Adaptive Streaming Over HTTP Using Multiple Connetions Samar Ibrahim, Ahmed H. Zahran and Mahmoud H. Ismail Department of Eletronis and Eletrial Communiations, Faulty
More informationDirect-Mapped Caches
A Case for Diret-Mapped Cahes Mark D. Hill University of Wisonsin ahe is a small, fast buffer in whih a system keeps those parts, of the ontents of a larger, slower memory that are likely to be used soon.
More informationPerformance Benchmarks for an Interactive Video-on-Demand System
Performane Benhmarks for an Interative Video-on-Demand System. Guo,P.G.Taylor,E.W.M.Wong,S.Chan,M.Zukerman andk.s.tang ARC Speial Researh Centre for Ultra-Broadband Information Networks (CUBIN) Department
More informationChapter 2: Introduction to Maple V
Chapter 2: Introdution to Maple V 2-1 Working with Maple Worksheets Try It! (p. 15) Start a Maple session with an empty worksheet. The name of the worksheet should be Untitled (1). Use one of the standard
More informationA Partial Sorting Algorithm in Multi-Hop Wireless Sensor Networks
A Partial Sorting Algorithm in Multi-Hop Wireless Sensor Networks Abouberine Ould Cheikhna Department of Computer Siene University of Piardie Jules Verne 80039 Amiens Frane Ould.heikhna.abouberine @u-piardie.fr
More informationEstablishing Secure Ethernet LANs Using Intelligent Switching Hubs in Internet Environments
Establishing Seure Ethernet LANs Using Intelligent Swithing Hubs in Internet Environments WOEIJIUNN TSAUR AND SHIJINN HORNG Department of Eletrial Engineering, National Taiwan University of Siene and Tehnology,
More informationNONLINEAR BACK PROJECTION FOR TOMOGRAPHIC IMAGE RECONSTRUCTION. Ken Sauer and Charles A. Bouman
NONLINEAR BACK PROJECTION FOR TOMOGRAPHIC IMAGE RECONSTRUCTION Ken Sauer and Charles A. Bouman Department of Eletrial Engineering, University of Notre Dame Notre Dame, IN 46556, (219) 631-6999 Shool of
More informationReduced-Complexity Column-Layered Decoding and. Implementation for LDPC Codes
Redued-Complexity Column-Layered Deoding and Implementation for LDPC Codes Zhiqiang Cui 1, Zhongfeng Wang 2, Senior Member, IEEE, and Xinmiao Zhang 3 1 Qualomm In., San Diego, CA 92121, USA 2 Broadom Corp.,
More informationScheduling Multiple Independent Hard-Real-Time Jobs on a Heterogeneous Multiprocessor
Sheduling Multiple Independent Hard-Real-Time Jobs on a Heterogeneous Multiproessor Orlando Moreira NXP Semiondutors Researh Eindhoven, Netherlands orlando.moreira@nxp.om Frederio Valente Universidade
More information1. Introduction. 2. The Probable Stope Algorithm
1. Introdution Optimization in underground mine design has reeived less attention than that in open pit mines. This is mostly due to the diversity o underground mining methods and omplexity o underground
More informationTrajectory Tracking Control for A Wheeled Mobile Robot Using Fuzzy Logic Controller
Trajetory Traking Control for A Wheeled Mobile Robot Using Fuzzy Logi Controller K N FARESS 1 M T EL HAGRY 1 A A EL KOSY 2 1 Eletronis researh institute, Cairo, Egypt 2 Faulty of Engineering, Cairo University,
More information8 Instruction Selection
8 Instrution Seletion The IR ode instrutions were designed to do exatly one operation: load/store, add, subtrat, jump, et. The mahine instrutions of a real CPU often perform several of these primitive
More informationApproximate logic synthesis for error tolerant applications
Approximate logi synthesis for error tolerant appliations Doohul Shin and Sandeep K. Gupta Eletrial Engineering Department, University of Southern California, Los Angeles, CA 989 {doohuls, sandeep}@us.edu
More informationAbstract. Key Words: Image Filters, Fuzzy Filters, Order Statistics Filters, Rank Ordered Mean Filters, Channel Noise. 1.
Fuzzy Weighted Rank Ordered Mean (FWROM) Filters for Mixed Noise Suppression from Images S. Meher, G. Panda, B. Majhi 3, M.R. Meher 4,,4 Department of Eletronis and I.E., National Institute of Tehnology,
More informationReading Object Code. A Visible/Z Lesson
Reading Objet Code A Visible/Z Lesson The Idea: When programming in a high-level language, we rarely have to think about the speifi ode that is generated for eah instrution by a ompiler. But as an assembly
More informationDynamic Backlight Adaptation for Low Power Handheld Devices 1
Dynami Baklight Adaptation for ow Power Handheld Devies 1 Sudeep Pasriha, Manev uthra, Shivajit Mohapatra, Nikil Dutt and Nalini Venkatasubramanian 444, Computer Siene Building, Shool of Information &
More informationUnsupervised Stereoscopic Video Object Segmentation Based on Active Contours and Retrainable Neural Networks
Unsupervised Stereosopi Video Objet Segmentation Based on Ative Contours and Retrainable Neural Networks KLIMIS NTALIANIS, ANASTASIOS DOULAMIS, and NIKOLAOS DOULAMIS National Tehnial University of Athens
More informationContents Contents...I List of Tables...VIII List of Figures...IX 1. Introduction Information Retrieval... 8
Contents Contents...I List of Tables...VIII List of Figures...IX 1. Introdution... 1 1.1. Internet Information...2 1.2. Internet Information Retrieval...3 1.2.1. Doument Indexing...4 1.2.2. Doument Retrieval...4
More informationA Dual-Hamiltonian-Path-Based Multicasting Strategy for Wormhole-Routed Star Graph Interconnection Networks
A Dual-Hamiltonian-Path-Based Multiasting Strategy for Wormhole-Routed Star Graph Interonnetion Networks Nen-Chung Wang Department of Information and Communiation Engineering Chaoyang University of Tehnology,
More informationVolume 3, Issue 9, September 2013 International Journal of Advanced Research in Computer Science and Software Engineering
Volume 3, Issue 9, September 2013 ISSN: 2277 128X International Journal of Advaned Researh in Computer Siene and Software Engineering Researh Paper Available online at: www.ijarsse.om A New-Fangled Algorithm
More informationTorpedo Trajectory Visual Simulation Based on Nonlinear Backstepping Control
orpedo rajetory Visual Simulation Based on Nonlinear Bakstepping Control Peng Hai-jun 1, Li Hui-zhou Chen Ye 1, 1. Depart. of Weaponry Eng, Naval Univ. of Engineering, Wuhan 400, China. Depart. of Aeronautial
More informationA {k, n}-secret Sharing Scheme for Color Images
A {k, n}-seret Sharing Sheme for Color Images Rastislav Luka, Konstantinos N. Plataniotis, and Anastasios N. Venetsanopoulos The Edward S. Rogers Sr. Dept. of Eletrial and Computer Engineering, University
More informationC 2 C 3 C 1 M S. f e. e f (3,0) (0,1) (2,0) (-1,1) (1,0) (-1,0) (1,-1) (0,-1) (-2,0) (-3,0) (0,-2)
SPECIAL ISSUE OF IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION: MULTI-ROBOT SSTEMS, 00 Distributed reonfiguration of hexagonal metamorphi robots Jennifer E. Walter, Jennifer L. Welh, and Nany M. Amato Abstrat
More informationCapturing Large Intra-class Variations of Biometric Data by Template Co-updating
Capturing Large Intra-lass Variations of Biometri Data by Template Co-updating Ajita Rattani University of Cagliari Piazza d'armi, Cagliari, Italy ajita.rattani@diee.unia.it Gian Lua Marialis University
More information35 th Design Automation Conference Copyright 1998 ACM
Using Reongurable Computing Tehniques to Aelerate Problems in the CAD Domain: A Case Study with Boolean Satisability Peixin Zhong, Pranav Ashar, Sharad Malik and Margaret Martonosi Prineton University
More informationCluster-based Cooperative Communication with Network Coding in Wireless Networks
Cluster-based Cooperative Communiation with Network Coding in Wireless Networks Zygmunt J. Haas Shool of Eletrial and Computer Engineering Cornell University Ithaa, NY 4850, U.S.A. Email: haas@ee.ornell.edu
More informationCleanUp: Improving Quadrilateral Finite Element Meshes
CleanUp: Improving Quadrilateral Finite Element Meshes Paul Kinney MD-10 ECC P.O. Box 203 Ford Motor Company Dearborn, MI. 8121 (313) 28-1228 pkinney@ford.om Abstrat: Unless an all quadrilateral (quad)
More informationSmooth Trajectory Planning Along Bezier Curve for Mobile Robots with Velocity Constraints
Smooth Trajetory Planning Along Bezier Curve for Mobile Robots with Veloity Constraints Gil Jin Yang and Byoung Wook Choi Department of Eletrial and Information Engineering Seoul National University of
More information3-D IMAGE MODELS AND COMPRESSION - SYNTHETIC HYBRID OR NATURAL FIT?
3-D IMAGE MODELS AND COMPRESSION - SYNTHETIC HYBRID OR NATURAL FIT? Bernd Girod, Peter Eisert, Marus Magnor, Ekehard Steinbah, Thomas Wiegand Te {girod eommuniations Laboratory, University of Erlangen-Nuremberg
More informationDETECTION METHOD FOR NETWORK PENETRATING BEHAVIOR BASED ON COMMUNICATION FINGERPRINT
DETECTION METHOD FOR NETWORK PENETRATING BEHAVIOR BASED ON COMMUNICATION FINGERPRINT 1 ZHANGGUO TANG, 2 HUANZHOU LI, 3 MINGQUAN ZHONG, 4 JIAN ZHANG 1 Institute of Computer Network and Communiation Tehnology,
More informationExploiting Enriched Contextual Information for Mobile App Classification
Exploiting Enrihed Contextual Information for Mobile App Classifiation Hengshu Zhu 1 Huanhuan Cao 2 Enhong Chen 1 Hui Xiong 3 Jilei Tian 2 1 University of Siene and Tehnology of China 2 Nokia Researh Center
More informationReading Object Code. A Visible/Z Lesson
Reading Objet Code A Visible/Z Lesson The Idea: When programming in a high-level language, we rarely have to think about the speifi ode that is generated for eah instrution by a ompiler. But as an assembly
More informationBring Your Own Coding Style
Bring Your Own Coding Style Naoto Ogura, Shinsuke Matsumoto, Hideaki Hata and Shinji Kusumoto Graduate Shool of Information Siene and Tehnology, Osaka University, Japan {n-ogura, shinsuke, kusumoto@ist.osaka-u.a.jp
More informationA service-oriented UML profile with formal support
A servie-oriented UML profile with formal support Roberto Bruni 1, Matthias Hölzl 3, Nora Koh 2,3, Alberto Lluh Lafuente 1, Philip Mayer 3, Ugo Montanari 1, and Andreas Shroeder 3 1 University of Pisa,
More informationDepartment of Electrical and Computer Engineering University of Wisconsin Madison. Fall
Department of Eletrial and Computer Engineering University of Wisonsin Madison ECE 553: Testing and Testable Design of Digital Systems Fall 2014-2015 Assignment #2 Date Tuesday, September 25, 2014 Due
More informationMining effective design solutions based on a model-driven approach
ata Mining VI 463 Mining effetive design solutions based on a model-driven approah T. Katsimpa 2, S. Sirmakessis 1,. Tsakalidis 1,2 & G. Tzimas 1,2 1 Researh ademi omputer Tehnology Institute, Hellas 2
More informationSelf-Adaptive Parent to Mean-Centric Recombination for Real-Parameter Optimization
Self-Adaptive Parent to Mean-Centri Reombination for Real-Parameter Optimization Kalyanmoy Deb and Himanshu Jain Department of Mehanial Engineering Indian Institute of Tehnology Kanpur Kanpur, PIN 86 {deb,hjain}@iitk.a.in
More informationZ8530 Programming Guide
Z8530 Programming Guide Alan Cox alan@redhat.om Z8530 Programming Guide by Alan Cox Copyright 2000 by Alan Cox This doumentation is free software; you an redistribute it and/or modify it under the terms
More informationDECODING OF ARRAY LDPC CODES USING ON-THE FLY COMPUTATION Kiran Gunnam, Weihuang Wang, Euncheol Kim, Gwan Choi, Mark Yeary *
DECODING OF ARRAY LDPC CODES USING ON-THE FLY COMPUTATION Kiran Gunnam, Weihuang Wang, Eunheol Kim, Gwan Choi, Mark Yeary * Dept. of Eletrial Engineering, Texas A&M University, College Station, TX-77840
More informationDetection and Recognition of Non-Occluded Objects using Signature Map
6th WSEAS International Conferene on CIRCUITS, SYSTEMS, ELECTRONICS,CONTROL & SIGNAL PROCESSING, Cairo, Egypt, De 9-31, 007 65 Detetion and Reognition of Non-Oluded Objets using Signature Map Sangbum Park,
More informationImproved Vehicle Classification in Long Traffic Video by Cooperating Tracker and Classifier Modules
Improved Vehile Classifiation in Long Traffi Video by Cooperating Traker and Classifier Modules Brendan Morris and Mohan Trivedi University of California, San Diego San Diego, CA 92093 {b1morris, trivedi}@usd.edu
More informationA Formal Hybrid Analysis Technique for Composite Web Services Verification
A Formal Hybrid Analysis Tehnique for Composite Web Servies Verifiation MAY HAIDAR 1,2, HICHAM H. HALLAL 1 1 Computer Siene Department / Department of Eletrial Engineering Fahad Bin Sultan University P.O
More informationAlleviating DFT cost using testability driven HLS
Alleviating DFT ost using testability driven HLS M.L.Flottes, R.Pires, B.Rouzeyre Laboratoire d Informatique, de Robotique et de Miroéletronique de Montpellier, U.M. CNRS 5506 6 rue Ada, 34392 Montpellier
More informationGraph-Based vs Depth-Based Data Representation for Multiview Images
Graph-Based vs Depth-Based Data Representation for Multiview Images Thomas Maugey, Antonio Ortega, Pasal Frossard Signal Proessing Laboratory (LTS), Eole Polytehnique Fédérale de Lausanne (EPFL) Email:
More informationReducing Runtime Complexity of Long-Running Application Services via Dynamic Profiling and Dynamic Bytecode Adaptation for Improved Quality of Service
Reduing Runtime Complexity of Long-Running Appliation Servies via Dynami Profiling and Dynami Byteode Adaptation for Improved Quality of Servie ABSTRACT John Bergin Performane Engineering Laboratory University
More informationDynamic System Identification and Validation of a Quadrotor UAV
Dynami System Identifiation and Validation of a Quadrotor UAV Min Goo Yoo PG Student, Department of Aerospae Engineering, Sejong University, Seoul, Republi of Korea E-mail: mingooyoo@gmailom Sung Kyung
More informationVideo Data and Sonar Data: Real World Data Fusion Example
14th International Conferene on Information Fusion Chiago, Illinois, USA, July 5-8, 2011 Video Data and Sonar Data: Real World Data Fusion Example David W. Krout Applied Physis Lab dkrout@apl.washington.edu
More informationPost-K Supercomputer with Fujitsu's Original CPU, A64FX Powered by Arm ISA
Post-K Superomputer with Fujitsu's Original CPU, A64FX Powered by Arm ISA Toshiyuki Shimizu Nov. 15th, 2018 Post-K is under development, information in these slides is subjet to hange without notie 0 Agenda
More informationArchitecture and Performance of the Hitachi SR2201 Massively Parallel Processor System
Arhiteture and Performane of the Hitahi SR221 Massively Parallel Proessor System Hiroaki Fujii, Yoshiko Yasuda, Hideya Akashi, Yasuhiro Inagami, Makoto Koga*, Osamu Ishihara*, Masamori Kashiyama*, Hideo
More informationParticle Swarm Optimization for the Design of High Diffraction Efficient Holographic Grating
Original Artile Partile Swarm Optimization for the Design of High Diffration Effiient Holographi Grating A.K. Tripathy 1, S.K. Das, M. Sundaray 3 and S.K. Tripathy* 4 1, Department of Computer Siene, Berhampur
More informationMulti-Piece Mold Design Based on Linear Mixed-Integer Program Toward Guaranteed Optimality
INTERNATIONAL CONFERENCE ON MANUFACTURING AUTOMATION (ICMA200) Multi-Piee Mold Design Based on Linear Mixed-Integer Program Toward Guaranteed Optimality Stephen Stoyan, Yong Chen* Epstein Department of
More informationEXODUS II: A Finite Element Data Model
SAND92-2137 Unlimited Release Printed November 1995 Distribution Category UC-705 EXODUS II: A Finite Element Data Model Larry A. Shoof, Vitor R. Yarberry Computational Mehanis and Visualization Department
More informationSpace- and Time-Efficient BDD Construction via Working Set Control
Spae- and Time-Effiient BDD Constrution via Working Set Control Bwolen Yang Yirng-An Chen Randal E. Bryant David R. O Hallaron Computer Siene Department Carnegie Mellon University Pittsburgh, PA 15213.
More informationAn Optimized Approach on Applying Genetic Algorithm to Adaptive Cluster Validity Index
IJCSES International Journal of Computer Sienes and Engineering Systems, ol., No.4, Otober 2007 CSES International 2007 ISSN 0973-4406 253 An Optimized Approah on Applying Geneti Algorithm to Adaptive
More informationDr.Hazeem Al-Khafaji Dept. of Computer Science, Thi-Qar University, College of Science, Iraq
Volume 4 Issue 6 June 014 ISSN: 77 18X International Journal of Advaned Researh in Computer Siene and Software Engineering Researh Paper Available online at: www.ijarsse.om Medial Image Compression using
More informationInterconnection Styles
Interonnetion tyles oftware Design Following the Export (erver) tyle 2 M1 M4 M5 4 M3 M6 1 3 oftware Design Following the Export (Client) tyle e 2 e M1 M4 M5 4 M3 M6 1 e 3 oftware Design Following the Export
More information特集 Road Border Recognition Using FIR Images and LIDAR Signal Processing
デンソーテクニカルレビュー Vol. 15 2010 特集 Road Border Reognition Using FIR Images and LIDAR Signal Proessing 高木聖和 バーゼル ファルディ Kiyokazu TAKAGI Basel Fardi ヘンドリック ヴァイゲル Hendrik Weigel ゲルド ヴァニーリック Gerd Wanielik This paper
More informationSAND Unlimited Release Printed November 1995 Updated November 29, :26 PM EXODUS II: A Finite Element Data Model
SAND92-2137 Unlimited Release Printed November 1995 Updated November 29, 2006 12:26 PM EXODUS II: A Finite Element Data Model Gregory D. Sjaardema (updated version) Larry A. Shoof, Vitor R. Yarberry Computational
More informationAllocating Rotating Registers by Scheduling
Alloating Rotating Registers by Sheduling Hongbo Rong Hyunhul Park Cheng Wang Youfeng Wu Programming Systems Lab Intel Labs {hongbo.rong,hyunhul.park,heng..wang,youfeng.wu}@intel.om ABSTRACT A rotating
More informationSeries/1 GA File No i=:: IBM Series/ Battery Backup Unit Description :::5 ~ ~ >-- ffi B~88 ~0 (] II IIIIII
Series/1 I. (.. GA34-0032-0 File No. 51-10 a i=:: 5 Q 1 IBM Series/1 4999 Battery Bakup Unit Desription B88 0 (] o. :::5 >-- ffi "- I II1111111111IIIIII1111111 ---- - - - - ----- --_.- Series/1 «h: ",
More informationCS:APP2e Web Aside ASM:X87: X87-Based Support for Floating Point
CS:APP2e Web Aside ASM:X87: X87-Based Support for Floating Point Randal E. Bryant David R. O Hallaron June 5, 2012 Notie The material in this doument is supplementary material to the book Computer Systems,
More informationSelf-aware and Self-expressive Camera Networks
1 Self-aware and Self-expressive Camera Networks Bernhard Rinner, Lukas Esterle, Jennifer Simonjan, Georg Nebehay, Roman Pflugfelder, Peter R. Lewis and Gustavo Fernández Domínguez Abstrat Reent advanes
More informationReverse Engineering of Assembler Programs: A Model-Based Approach and its Logical Basis
Reverse Engineering of Assembler Programs: A Model-Based Approah and its Logial Basis Tom Lake and Tim Blanhard, InterGlossa Ltd., Reading, UK Tel: +44 174 561919 email: {Tom.Lake,Tim.Blanhard}@glossa.o.uk
More informationFast Distribution of Replicated Content to Multi- Homed Clients Mohammad Malli Arab Open University, Beirut, Lebanon
ACEEE Int. J. on Information Tehnology, Vol. 3, No. 2, June 2013 Fast Distribution of Repliated Content to Multi- Homed Clients Mohammad Malli Arab Open University, Beirut, Lebanon Email: mmalli@aou.edu.lb
More informationAn Efficient and Scalable Approach to CNN Queries in a Road Network
An Effiient and Salable Approah to CNN Queries in a Road Network Hyung-Ju Cho Chin-Wan Chung Dept. of Eletrial Engineering & Computer Siene Korea Advaned Institute of Siene and Tehnology 373- Kusong-dong,
More information