IPPS 2003 - PDF Preprint Papers

IPPS 2003 International Parallel Processing Symposium

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed IPPS-2003 Paper

click to vote

IPPS
2003
IEEE

260views Distributed And Parallel Com...» more IPPS 2003»

Constrained Component Deployment in Wide-Area Networks Using AI Planning Techniques

13 years 10 months ago

Download www.cs.nyu.edu

Component-based models represent a dominant trend in the construction of wide-area network applications, making possible the integration of diverse functionality contained in modu...

Tatiana Kichkaylo, Anca-Andreea Ivan, Vijay Karamc...

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	260	Constrained Component Deployment in Wide-Area Networks Using AI Planning Techniques	claim
2	247	Applying Aspect-Orient Programming Concepts to a Component-Based Programming Model	claim
3	228	Accurate Method for Fast Design of Diagnostic Oligonucleotide Probe Sets for DNA Microarrays	claim
4	216	Distributed P2P Computing within Triana: A Galaxy Visualization Test Case	claim
5	207	An Implicitly Parallel Object-Oriented Matrix Library and its Application to Medical Physics	claim
6	198	A Hierarchical Model for Distributed Collaborative Computation in Wireless Sensor Networks	claim
7	193	Task Pool Teams for Implementing Irregular Algorithms on Clusters of SMPs	claim
8	186	Are E-Commerce Users Defenceless?	claim
9	180	Parallel Heterogeneous Genetic Algorithms for Continuous Optimization	claim
10	177	Agent-Based Grid Load Balancing Using Performance-Driven Task Scheduling	claim
11	177	Mesh Partitioning: A Multilevel Ant-Colony-Optimization Algorithm	claim
12	173	Dynamic Mapping in a Heterogeneous Environment with Tasks Having Priorities and Multiple Deadlines	claim
13	173	A Compilation Framework for Distributed Memory Parallelization of Data Mining Algorithms	claim
14	172	Short Vector Code Generation for the Discrete Fourier Transform	claim
15	171	New Dynamic Heuristics in the Client-Agent-Server Model	claim
16	170	Loop Dissevering: A Technique for Temporally Partitioning Loops in Dynamically Reconfigurable Computing Platforms	claim
17	169	Performing DNA Comparison on a Bio-Inspired Tissue of FPGAs	claim
18	169	The CoGenT Project: Co-Generating Compilers and Simulators for Dynamically Compiled Languages	claim
19	169	Energy Aware Scheduling for Distributed Real-Time Systems	claim
20	167	MIP Formulation for Robust Resource Allocation in Dynamic Real-Time Systems	claim
21	166	Approximate Search Engine Optimization for Directory Service	claim
22	163	Definition of a Robustness Metric for Resource Allocation	claim
23	161	A BSP/CGM Algorithm for the All-Substrings Longest Common Subsequence Problem	claim
24	161	RMIX: A Multiprotocol RMI Framework for Java	claim
25	159	AmpNet - A Highly Available Cluster Interconnection Network	claim
26	159	On the Appropriateness of Commodity Operating Systems for Large-Scale, Balanced Computing Systems	claim
27	157	Fast Online Task Placement on FPGAs: Free Space Partitioning and 2D-Hashing	claim
28	156	Ad Hoc Networks: A Protocol for Supporting QoS Applications	claim
29	156	GCA: A Massively Parallel Model	claim
30	155	A Message Passing Interface Library for Inhomogeneous Coupled Clusters	claim
31	154	Channel Assignment on Strongly-Simplicial Graphs	claim
32	154	Lazy Parallelization: A Finite State Machine Based Optimization Approach for Data Parallel Image Processing Applications	claim
33	154	SoCBUS: Switched Network on Chip for Hard Real Time Embedded Systems	claim
34	152	Effective Utilization and Reconfiguration of Distributed Hardware Resources Using Job Management Systems	claim
35	152	Extending OpenMP to Support Slipstream Execution Mode	claim
36	151	Dual Priority Algorithm to Schedule Real-Time Tasks in a Shared Memory Multiprocessor	claim
37	149	A Divided-Screenwise Hierarchical Compositing for Sort-Last Parallel Volume Rendering	claim
38	149	Leveraging Block Decisions and Aggregation in the ShareStreams QoS Architecture	claim
39	149	A Case Study of Selected SPLASH-2 Applications and the SBT Debugging Tool	claim
40	148	Global Communication Optimization for Tensor Contraction Expressions under Memory Constraints	claim
41	147	Remote Model Reduction of Very Large Linear Systems	claim
42	147	Anonymous Publish/Subscribe in P2P Networks	claim
43	147	An Analysis of Performance Enhancement Techniques for Overset Grid Applications	claim
44	147	Dynamically Loaded Classes as Shared Libraries: An Approach to Improving Virtual Machine Scalability	claim
45	146	Dynamic Resource Discovery for Applications Survivability in Distributed Real-Time Systems	claim
46	145	Autonomous Protocols for Bandwidth-Centric Scheduling of Independent-Task Applications	claim
47	144	A P2P Approach for Global Computing	claim
48	144	Simulation of Dynamic Data Replication Strategies in Data Grids	claim
49	143	A Polymorphic Hardware Platform	claim
50	143	Padico: A Component-Based Software Infrastructure for Grid Computing	claim
51	143	A Web Service-Based Experiment Management System for the Grid	claim
52	143	Automated RTR Temporal Partitioning for Reconfigurable Embedded Real-Time System Design	claim
53	142	ECO: An Empirical-Based Compilation and Optimization System	claim
54	142	CORBA Benchmarking: A Course with Hidden Obstacles	claim
55	142	An Approach to Heterogeneous Process State Capture/Recovery to Achieve Minimum Performance Overhead During Normal Execution	claim
56	142	Integration of a CAN-Based Connection-Oriented Communication Model into Real-Time CORBA	claim
57	142	A GRASP-Based Algorithm for Solving DVE Partitioning Problem	claim
58	141	SCIMPS: An Integrated Approach to Distributed Processing in Sensor Webs	claim
59	141	Importance of SIMD Computation Reconsidered	claim
60	140	Quantifying Locality Effect in Data Access Delay: Memory logP	claim
61	140	A Genetic Approach to Planning in Heterogeneous Computing Environments	claim
62	139	A Case Study of Optimistic Computing on the Grid: Parallel Mesh Generation	claim
63	139	Hardware Implementation of a Montgomery Modular Multiplier in a Systolic Array	claim
64	139	A Framework for Portable Shared Memory Programming	claim
65	138	So Many States, So Little Time: Verifying Memory Coherence in the Cray X1	claim
66	137	Implementation of a Calendar Application Based on SyD Coordination Links	claim
67	136	Distributed Process Networks in Java	claim
68	135	A Sleep-Awake Protocol for Information Propagation in Smart Dust Networks	claim
69	135	Application/Kernel Cooperation Towards the Efficient Execution of Shared-Memory Parallel Java Codes	claim
70	134	A Fast Algorithm for the Exhaustive Analysis of 12-Nucleotide-Long DNA Sequences. Applications to Human Genomics	claim
71	134	Performance of Distributed Algorithms for Topology Control in Wireless Networks	claim
72	133	Optimizing Synchronization Operations for Remote Memory Communication Systems	claim
73	133	Performance Monitoring and Evaluation of a UPC Implementation on a NUMA Architecture	claim
74	133	Partitioning with Space-Filling Curves on the Cubed-Sphere	claim
75	133	Grid Harvest Service: A System for Long-Term, Application-Level Task Scheduling	claim
76	132	From Legion to Legion-G to OGSI.NET: Object-Based Computing for Grids	claim
77	132	A Novel Design Technology for Next Generation Ubiquitous Computing Architecture	claim
78	132	Expresso and Chips: Creating a Next Generation Microarray Experiment Management System	claim
79	131	An Executable Analytical Performance Evaluation Approach for Early Performance Prediction	claim
80	131	Real-Time Primer Design for DNA Chips	claim
81	131	Reconfigurable Processor Architectures for Mobile Phones	claim
82	130	Performance and Overhead in a Hybrid Reconfigurable Computer	claim
83	130	Heterogeneous Access to Service-Based Distributed Computing: The RMIX Approach	claim
84	130	System-Level Modeling of Dynamically Reconfigurable Hardware with SystemC	claim
85	130	Parallel Direct Solution of Linear Equations on FPGA-Based Machines	claim
86	129	Better Real-Time Response for Time-Share Scheduling	claim
87	129	A Generic Broadcast Protocol in Ad Hoc Networks Based on Self-Pruning	claim
88	129	BLAM : A High-Performance Routing Algorithm for Virtual Cut-Through Networks	claim
89	128	A Generic Scheme for Building Overlay Networks in Adversarial Scenarios	claim
90	128	Cost/Performance Tradeoffs in Network Interconnects for Clusters of Commodity PCs	claim
91	128	An Object Oriented Framework for an Associative Model of Parallel Computation	claim
92	128	The Case for Fair Multiprocessor Scheduling	claim
93	127	Load-Balancing Scatter Operations for Grid Computing	claim
94	127	Reconfigurable Architecture Requirements for Co-Designed Virtual Machines	claim
95	126	Gene Clustering Using Self-Organizing Maps and Particle Swarm Optimization	claim
96	125	Recovery Schemes for High Availability and High Performance Distributed Real-Time Computing	claim
97	125	Homeostatic and Tendency-Based CPU Load Predictions	claim
98	124	Some Modular Adders and Multipliers for Field Programmable Gate Arrays	claim
99	124	Contact-Based Architecture for Resource Discovery (CARD) in Large Scale MANets	claim
100	124	Using Golomb Rulers for Optimal Recovery Schemes in Fault Tolerant Distributed Computing	claim
101	124	Adaptive Image Filtering Using Run-Time Reconfiguration	claim
102	124	An Extended Link Reversal Protocol in Dynamic Networks	claim
103	122	Architectural Frameworks for MPP Systems on a Chip	claim
104	122	HMPI: Towards a Message-Passing Library for Heterogeneous Networks of Computers	claim
105	122	SPMD Image Processing on Beowulf Clusters: Directives and Libraries	claim
106	121	Using Incorrect Speculation to Prefetch Data in a Concurrent Multithreaded Processor	claim
107	121	Improving Quality of Service in Application Clusters	claim
108	121	Mapping of DSP Algorithms on the MONTIUM Architecture	claim
109	121	Parallel Detection of Regulatory Elements with gMP	claim
110	121	A Performance Interface for Component-Based Applications	claim
111	120	Parallel Tabu Search in a Heterogeneous Environment	claim
112	120	A General Framework for Searching in Distributed Data Repositories	claim
113	120	The Maximal Utilization of Processor Co-Allocation in Multicluster Systems	claim
114	119	FORGE: A Framework for Optimization of Distributed Embedded Systems Software	claim
115	119	Multi-Paradigm Framework for Parallel Image Processing	claim
116	118	Parallel ROLAP Data Cube Construction On Shared-Nothing Multiprocessors	claim
117	118	Master-slave Tasking on Heterogeneous Processors	claim
118	118	The Reconstruction of a Mobile Agent Computation and Its Validation	claim
119	118	Selective Optimization of Locks by Runtime Statistics and Just-in-Time Compilation	claim
120	118	UMR: A Multi-Round Algorithm for Scheduling Divisible Workloads	claim
121	117	Continuous Compilation: A New Approach to Aggressive and Adaptive Code Transformation	claim
122	117	Founding FireWire Bridges through Promela Prototyping	claim
123	116	Wrapping Legacy Codes for Grid-Based Applications	claim
124	116	Design and Evaluation of a Parallel HOP Clustering Algorithm for Cosmological Simulation	claim
125	115	An Architecture for Distributed Applications on the Internet: Overview of Microsoft's .NET Platform	claim
126	115	The First Approximated Distributed Algorithm for the Minimum Degree Spanning Tree Problem on General Graphs	claim
127	115	Orientation Refinement of Virus Structures with Unknown Symmetry	claim
128	115	Automatic Resource Management Using an Adaptive Parallelism Environment	claim
129	115	Solving the Protein Threading Problem in Parallel	claim
130	114	MUSE: A Software Oscilloscope for Clusters and Grids	claim
131	113	Flexible CoScheduling: Mitigating Load Imbalance and Improving Utilization of Heterogeneous Resources	claim
132	113	PROSIDIS: A Special Purpose Processor for PROtein SImilarity DIScovery	claim
133	113	Towards a Theory of Bisimulation for a Fragment of Verilog	claim
134	112	Addressable Procedures for Logic and Arithmetic Operations with DNA Strands	claim
135	112	Performance Modeling for Entity-Level Simulations	claim
136	112	Distributed Geo-Rectification of Satellite Images Using Grid Computing	claim
137	111	One-Step Algorithm for Mixed Data and Task Parallel Scheduling without Data Replication	claim
138	111	Experiences and Lessons Learned with a Portable Interface to Hardware Performance Counters	claim
139	111	Exploring the Predictability of MPI Messages	claim
140	111	Fault-Tolerant Multi-Server Video-on-Demand Service	claim
141	111	On Self-Similarity and Hamiltonicity of Dual-Cubes	claim
142	110	Supporting QoS-Based Discovery in Service-Oriented Grids	claim
143	110	Targeting Tiled Architectures in Design Exploration	claim
144	109	Quality of Service in Wireless Networks	claim
145	109	Performance and Scalability of the NAS Parallel Benchmarks in Java	claim
146	109	A Limited-Global Information Model for Fault-Tolerant Routing in Dual-Cube	claim
147	109	Evolutionary Fault Recovery in a Virtex FPGA Using a Representation that Incorporates Routing	claim
148	109	Programming Metasystems with Active Objects	claim
149	108	A Hierarchical Resource Reservation Algorithm for Network Enabled	claim
150	108	Fast and Lock-Free Concurrent Priority Queues for Multi-Thread Systems	claim
151	108	Phylogenetic Tree Inference on PC Architectures with AxML/PAxML	claim
152	107	Dependability Analysis: A New Application for Run-Time Reconfiguration	claim
153	107	Remote and Partial Reconfiguration of FPGAs: Tools and Trends	claim
154	107	A Low Cost Fault Tolerant Packet Routing for Parallel Computers	claim
155	107	Parallel Multilevel Block ILU Preconditioning Techniques for Large Sparse Linear Systems	claim
156	107	Improving Speculative Thread-Level Parallelism Through Module Run-Length Prediction	claim
157	106	Exploiting Java-ILP on a Simultaneous Multi-Trace Instruction Issue (SMTI) Processor	claim
158	106	Benchmark and Framework for Encouraging Research on Multi-Threaded Testing Tools	claim
159	106	Using Hybrid Alignment for Iterative Sequence Database Searches	claim
160	105	Trust Modeling for Peer-to-Peer Based Computing Systems	claim
161	105	Using a Parallel CFD Code for Evaluation of Clusters and MPPs	claim
162	105	Sequence Alignment on the Cray MTA-2	claim
163	105	Project JebX: A Java ebXML Experience	claim
164	105	Intelligent Architecture for Automatic Resource Allocation in Computer Clusters	claim
165	105	Active Memory Techniques for ccNUMA Multiprocessors	claim
166	105	Dynamic Power Management of Heterogeneous Systems	claim
167	105	Miss Penalty Reduction Using Bundled Capacity Prefetching in Multiprocessors	claim
168	104	A New DMA Registration Strategy for Pinning-Based High Performance Networks	claim
169	104	Are We Really Ready for the Breakthrough?	claim
170	104	Parallelisation of IBD Computation for Determining Genetic Disease Map	claim
171	104	Workshop Introduction	claim
172	103	Multiple Instruction Stream Control for an Associative Model of Parallel Computation	claim
173	103	Performance Modeling of the Grace Hash Join on Cluster Architectures	claim
174	102	A Fast Algorithm for Online Placement and Reorganization of Replicated Data	claim
175	102	Wide-Area Content-Based Routing Mechanism	claim
176	100	mmGrid: Distributed Resource Management Infrastructure for Multimedia Applications	claim
177	100	An Evaluation of Current High-Performance Networks	claim
178	100	Performance Prediction of Paging Workloads Using Lightweight Tracing	claim
179	100	Natural Block Data Decomposition for Heterogeneous Clusters	claim
180	100	Supporting Peer-2-Peer Interactions in the Consumer Grid	claim
181	99	Shielded Processors: Guaranteeing Sub-millisecond Response in Standard Linux	claim
182	99	Model Checking a Cache Coherence Protocol for a Java DSM Implementation	claim
183	99	A Characterisation of Optimal Channel Assignments for Wireless Networks Modelled as Cellular and Square Grids	claim
184	99	Semi-Structured Portable Library for Multiprocessor Servers	claim
185	98	A Solution for Handling Hybrid Traffic in Clustered Environments: The MultiMedia Router MMR	claim
186	98	Performance Prediction and Its Use in Parallel and Distributed Computing Systems	claim
187	98	Applying Optical Reconfiguration on ATM Switch Fabrics	claim
188	97	Task Graph Scheduling Using Timed Automata	claim
189	97	Evaluation of a Hybrid Real-Time Bus Scheduling Mechanism for CAN	claim
190	97	Reasoning about Deadlines in Concurrent Real-Time Programs	claim
191	96	Resource Management for Parallel Adaptive Components	claim
192	96	Optimizing Performance and Reliability in Distributed Computing Systems through Wide Spectrum Storage	claim
193	96	Secret Key Cryptography with Cellular Automata	claim
194	96	A UNITY-Based Formalism for Dynamic Distributed Systems	claim
195	95	A Classification of Concurrency Failures in Java Components	claim
196	94	Modeling Parallel Applications Performance on Heterogeneous Systems	claim
197	94	The Lighweight Protocol CLIC on Gigabit Ethernet	claim
198	92	DPS - Dynamic Parallel Schedules	claim
199	92	Transparent Query Caching in Peer-to-Peer Overlay Networks	claim
200	91	Performance Properties of Combined Heterogeneous Networks	claim
201	90	Allocating Servers in Infostations for On-Demand Communications	claim
202	89	Performance Analysis of Distributed Search in Open Agent Systems	claim
203	89	Transparent Distributed Threads for Java	claim
204	87	A Framework for Collective Personalized Communication	claim
205	87	Towards Generic Satellite Payloads: Software Radio	claim
206	86	Parallel and Distributed Computing for an Adaptive Visual Object Retrieval System	claim
207	85	Methods for Parallel Simulations of Surface Reactions	claim
208	74	Parallel LAN/WAN Heuristics for Optimization	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers