Sciweavers

1923 search results - page 344 / 385
» Modeling Complexity in Secure Distributed Computing
Sort
View
ICSOC
2010
Springer
14 years 8 months ago
A Programmble Fault Injection Testbed Generator for SOA
In this demo paper we present the prototype of our fault injection testbed generator. Our tool empowers engineers to generate emulated SOA environments and to program fault injecti...
Lukasz Juszczyk, Schahram Dustdar
DAC
2008
ACM
15 years 10 months ago
Automatic package and board decoupling capacitor placement using genetic algorithms and M-FDM
In the design of complex power distribution networks (PDN) with multiple power islands, it is required that the PDN represents a low impedance as seen by the digital modules. This...
Krishna Bharath, Ege Engin, Madhavan Swaminathan
MOBIHOC
2009
ACM
15 years 10 months ago
Improved bounds on the throughput efficiency of greedy maximal scheduling in wireless networks
Due to its low complexity, Greedy Maximal Scheduling (GMS), also known as Longest Queue First (LQF), has been studied extensively for wireless networks. However, GMS can result in...
Mathieu Leconte, Jian Ni, Rayadurgam Srikant
AUTONOMICS
2009
ACM
15 years 4 months ago
Sensor Selection for IT Infrastructure Monitoring
Supervisory control is the main means to assure a high level performance and availability of large IT infrastructures. Applied control theory is used in physical and virtualization...
Gergely János Paljak, Imre Kocsis, Zolt&aac...
ITNG
2008
IEEE
15 years 4 months ago
Parallel FFT Algorithms on Network-on-Chips
This paper presents several parallel FFT algorithms with different degree of communication overhead for multiprocessors in Network-on-Chip(NoC) environment. Three different method...
Jun Ho Bahn, Jungsook Yang, Nader Bagherzadeh