Sciweavers

1205 search results - page 184 / 241
» On P Systems with Bounded Parallelism
Sort
View
SCHEDULING
2011
14 years 10 months ago
On robust online scheduling algorithms
While standard parallel machine scheduling is concerned with good assignments of jobs to machines, we aim to understand how the quality of an assignment is affected if the jobs...
Michael Gatto, Peter Widmayer
SPAA
2009
ACM
16 years 26 days ago
At-most-once semantics in asynchronous shared memory
Abstract. At-most-once semantics is one of the standard models for object access in decentralized systems. Accessing an object, such as altering the state of the object by means of...
Sotiris Kentros, Aggelos Kiayias, Nicolas C. Nicol...
164
Voted
MIDDLEWARE
2007
Springer
15 years 10 months ago
A Utility-Aware Middleware Architecture for Decentralized Group Communication Applications
Abstract. The success of Internet telephony services like Skype illustrates the feasibility of utilizing unstructured Peer-to-Peer (P2P) networks as an economical platform for supp...
Jianjun Zhang, Ling Liu, Lakshmish Ramaswamy, Gong...
IEEEPACT
2009
IEEE
15 years 10 months ago
Quantifying the Potential of Program Analysis Peripherals
Abstract—As programmers are asked to manage more complicated parallel machines, it is likely that they will become increasingly dependent on tools such as multi-threaded data rac...
Mohit Tiwari, Shashidhar Mysore, Timothy Sherwood
FSTTCS
2009
Springer
15 years 10 months ago
Modelchecking counting properties of 1-safe nets with buffers in paraPSPACE
ABSTRACT. We consider concurrent systems that can be modelled as 1-safe Petri nets communicating through a fixed set of buffers (modelled as unbounded places). We identify a param...
M. Praveen, Kamal Lodaya